Re:P ≠ NP
by nkassis on Sunday August 08, 2010 @05:16PM
(#1586179)
To be a little more precise, proving P=NP would mean that there are algorithms to solve those problems that take polynomial time (can be calculated with a polynomial).
NP problems can be solved, it's just slow (think brute force method, running through all the possibilities).
NP problems can be solved, it's just slow (think brute force method, running through all the possibilities).