Fifty years of P vs. NP and the possibility of the impossible

[Kent Sharkey]

ACM[^]:

On May 4, 1971, computer scientist/mathematician Steve Cook introduced the P vs. NP problem to the world in his paper, "The Complexity of Theorem Proving Procedures." More than 50 years later, the world is still trying to solve it.

For those who mind their Ps and NPs

[Marc Clifton]

Quote:

Are there 300 Facebook users who are all friends with each other?

Who cares? See how easy it was to solve that problem? ;)

Latest Articles:
Your one-stop guide for API and web-client Form, XHR, Blob, and Drag & Drop File/Data Uploading

[Daniel Pfeffer]

That problem is A-complete A for apathy

Freedom is the freedom to say that two plus two make four. If that is granted, all else follows. -- 6079 Smith W.

[jeron1]

That would be 'P', as in pragmatic! :thumbsup:

"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle