Abstract
We investigate the problem of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. We focus on the case when it is enough for the verifier to know that the answer is close to correct. We use a model of proof systems which is based on interactive proof systems, probabilistically checkable proof systems, program checkers, and CS proofs. We develop protocols for several optimization problems, in which the running time of the verifier is significantly less than the size of the input. For example, we give polylogarithmic time protocols for showing the existence of a large cut, a large matching and a small bin packing. In contrast, the protocols used to show that IP = PSPACE, MIP = NEXP and NP = PCP(lg n, 1) [Sha90, BFL91, ALM+98, BFLS90] require a verifier that runs in Ω(n) time. In the process, we develop a set of tools for use in constructing these proof systems.
| Original language | English |
|---|---|
| Pages (from-to) | 41-50 |
| Number of pages | 10 |
| Journal | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |
| DOIs | |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA Duration: 1 May 1999 → 4 May 1999 |