The Status of the P Versus NP Problem | September 2009 | Communications of the ACM

the computer science landscape has dramatically changed in the nearly four decades since Steve Cook presented his seminal NP-completeness paper “The Complexity of Theorem-Proving Procedures” in Shaker Heights, OH in early May, 1971. Computational power has dramatically increased, the cost of computing has dramatically decreased, not to mention the power of the Internet.

Posted via web from Hooray for the bleeding edge

Advertisements

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: