Oh ok, I thought the first post was referring to a single algorithm, not every possible algorithm. My mistake.
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…
Oh ok, I thought the first post was referring to a single algorithm, not every possible algorithm. My mistake.
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…