3 ms·
> a practical, albeit incomprehensible, algorithm for solving NP complete problems. It would not not necessarily be practical, even if it ran in polynomial ti
by enriquto 1mo ago
> 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.
- js8 1mo agoI know, the goal was to strongman the argument.