On transformation of interactive proofs that preserve the prover's complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
A theory of goal-oriented communication
Journal of the ACM (JACM)
| Hi-index | 0.00 |
A basic question about NP is whether or not search reduces in polynomial time to decision. This paper indicates that the answer is negative: Under a complexity assumption (that deterministic and nondeterministic double-exponential time are unequal) a language in NP for which search does not reduce to decision is constructed. These ideas extend in a natural way to interactive proofs and program checking. Under similar assumptions, the authors present languages in NP for which it is harder to prove membership interactively than it is to decide this membership, and languages in NP that are not checkable.