Vinay Deolalikar, a mathematician working at HP Labs, has demonstrated a solution to the P versus NP problem to determine whether problems that can be verified in polynomial time can also be solved in polynomial time.
His paper may be found @ http://www.win.tue.nl/~gwoegi/P-versus-NP/Deolalikar.pdf
No comments:
Post a Comment