Friday, September 01, 2006

Andre Agassi & NP-complete

I just finished watching a unbelievable tennis game. No match can be better than this one. All the unbelievalbe games have equivalent elements, like all NP-complete problems are equivalent.
Posted by at
Labels:

1 comment:

Joe Dunbar said...

Helluva tennis match. I haven't been to the U.S. Open since 1997 but I love the USA nightly coverage.

12:34 AM

Post a Comment

Subscribe to: Post Comments (Atom)