Hacker News new | ask | show | jobs
by lisper 2616 days ago
It would look like an algorithm that solves an NP-complete problem in polynomial time. (Isn't that obvious?)
1 comments
sidusknight 2616 days ago
Sure. And why does that seem any more feasible than a non-constructive proof?
link
lisper 2616 days ago
I don't know. Why is the moon plaid?
link