Computational Complexity

About

Computational complexity and other fun stuff in math and computer science as viewed by Lance Fortnow and Bill Gasarch.

My Links

Bill's Home Page

Lance's Home Page

Weblog Archives and Search

Feeds: Posts Comments

Foundations of Complexity

Graduate Student Guide

Favorite Theorems

Recent Posts

Compulsory Voting with Careful Consideration of Ch...

Why is Lance Lance and GASARCH GASARCH?

More funny answers on math olympiad

Engineering Challenges

Valiant wins EATCS award

There is no such thing as a sure thing

Average Case versus Worst Case

The Moment of Truth

The Candidates on Science Funding

Complexity Links

IEEE Conference on Computational Complexity

Electronic Colloquium on Computational Complexity

BEATCS Computational Complexity Column

Favorite Complexity Books

Weblogs

Ars Mathematica

Computing Research Policy

Doron Zeilberger

Michael Mitzenmacher

Muthu Muthukrishnan

Michael Nielsen

Suresh Venkatasubramanian

Other Links

Nielsen's Principles of Research

Parberry's TCS Guides

Discussion Groups

Computer Science Theory

This work is licensed under a Creative Commons License.

Monday, February 25, 2008

Outed by Amazon

Posted by Lance

Either the worst or the best example of a recommendation system in action.

Via parterre box
6:19 AM #

Comment Feeds: This Post All

Links to this post:

<$BlogBacklinkTitle$>: <$BlogBacklinkSnippet$>
posted by <$BlogBacklinkAuthor$> @ <$BlogBacklinkDateTime$>

Weblog Home

Archives