News for hackers. Stuff that matters.
Re:P = NP Proofs: Advice to claimers by lisper on Monday April 22, 2019 @08:43PM (#19724583)
It would look like an algorithm that solves an NP-complete problem in polynomial time. (Isn't that obvious?)
Re:P = NP Proofs: Advice to claimers by sidusknight on Tuesday April 23, 2019 @09:39AM (#19728422)
Sure. And why does that seem any more feasible than a non-constructive proof?
Re:P = NP Proofs: Advice to claimers by lisper on Tuesday April 23, 2019 @11:22AM (#19729502)
I don't know. Why is the moon plaid?