Interactive Proofs and Approximation: Reductions from Two Provers in One Round (1992)
| Venue: | Proceedings of the Second Israel Symposium on Theory and Computing Systems |
| Citations: | 18 - 3 self |
BibTeX
@INPROCEEDINGS{Bellare92interactiveproofs,
author = {Mihir Bellare},
title = {Interactive Proofs and Approximation: Reductions from Two Provers in One Round},
booktitle = {Proceedings of the Second Israel Symposium on Theory and Computing Systems},
year = {1992},
pages = {266--274},
publisher = {Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present hard to approximate problems in the following areas: systems of representatives, network flow, and longest paths in graphs. In each case we show that there exists some ffi ? 0 such that polynomial time approximation to within a factor of 2 log ffi n of the optimal implies that NP has quasi polynomial time deterministic simulations. The results are derived by reduction from two prover, one round proof systems, and exemplify the ability of such reductions to yield hardness of approximations results for many different kinds of problems. Department of Computer Science & Engineering, Mail Code 0114, University of California at San Diego, 9500 Gilman Drive, La Jolla, CA 92093. E-mail: mihir@cs.ucsd.edu 1 Introduction The connection between (multi-prover) interactive proofs and approximation which originates in [FGLSS] has inaugurated a new and powerful approach to resolving the approximation complexity of optimization problems. Typically, one obtains results of the follow...
