4 ms·
It would look like an algorithm that solves an NP-complete problem in polynomial time. (Isn't that obvious?)
by lisper 8y ago
It would look like an algorithm that solves an NP-complete problem in polynomial time. (Isn't that obvious?)
- sidusknight 8y agoSure. And why does that seem any more feasible than a non-constructive proof?
- lisper 8y agoI don't know. Why is the moon plaid?