logoalt Hacker News

enriqutotoday at 6:16 AM1 replyview on HN

> a practical, albeit incomprehensible, algorithm for solving NP complete problems.

It would not not necessarily be practical, even if it ran in polynomial time. It may have cost O(n^c), with a totally out of order exponent like c=A(5,5) or whatever.


Replies

js8today at 7:59 AM

I know, the goal was to strongman the argument.