Efficient probabilistically checkable proofs and applications to approximations

@inproceedings{Bellare1993EfficientPC,
  title={Efficient probabilistically checkable proofs and applications to approximations},
  author={Mihir Bellare and Shafi Goldwasser and Carsten Lund and A. Russeli},
  booktitle={STOC},
  year={1993}
}
Efficient Probabilistically Checkable Proofs and Applications to Approximation M. BELLARE* S. GOLDWASSERt C. LUNDi A. RUSSELL$ We construct multi-prover proof systems for NP which use only a constant number of provers to simultaneously achieve low error, low randomness and low answer size. As a consequence, we obtain asymptotic improvements to approximation hardness results for a wide range of optimization problems including minimum set cover, dominating set, maximum clique, chromatic number… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 169 extracted citations

Similar Papers

Loading similar papers…