A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
The Complexity of Decision Versus Search
1994
SIAM journal on computing (Print)
A basic question about NP is whether or not search reduces in polynomial time to decision. We indicate that the answer is negative: under a complexity assumption that deterministic and non-deterministic double-exponential time are unequal we construct a language in NP for which search does not reduce to decision. These ideas extend in a natural way to interactive proofs and program checking. Under similar assumptions we present languages in NP for which it is harder to prove membership
doi:10.1137/s0097539792228289
fatcat:5h53wc3gsbeqjaneurwasrqa5a