Computer Science
Essential Abstractions
Index page
Archives
Does P = NP?
Posted by
scott
on December 12, 2008
Lose some sleep over this one. The general consensus is that P ⊂ NP, but that P ≠ NP.
The real problem (for now) is proving that either P = NP or P ≠ NP.
« Prev item • Next item »
Comments
No comments yet. You can be the first!
Leave comment
Your comment:
Name:
Website:
E-mail:
Remember Me
Categories
Index page
Algorithms
General
Languages
Archive
Dec, 2008
Statistics
Friends
Sneetches.net
Software Engineering
Virtual Machines
Scott's page
Login
Username:
Password:
Shared Computer