Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
GoGoGalois
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
by
GoGoGalois
14y ago
Oh ok, I thought the first post was referring to a single algorithm, not every possible algorithm. My mistake.
2.
▲
by
GoGoGalois
14y ago
If a problem is NP complete then there is an algorithm to solve it in nondeterminstic polynomial time. Any nondet algorithm can be transformed to an exp poly time algorithm (just run through each of your poly time algorithms one by one) so