Show that for any problem ∏ in NP, there is an algorithm which solves n in time O (2p(n)), where n is the size of the input instance and p(n) is a polynomial (which may depend on ∏).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.