Proof verification and the hardness of approximation problems
- 1 May 1998
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 45 (3), 501-555
- https://doi.org/10.1145/278298.278306
Abstract
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probability 1 (i.e., for every choice of its random string). For strings not in the language, the verifier rejects every provided “proof” with probability at least 1/2. Our result builds upon and improves a recent result of Arora and Safra [1998] whose verifiers examine a nonconstant number of bits in the proof (though this number is a very slowly growing function of the input length). As a consequence, we prove that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP = P. The class MAX SNP was defined by Papadimitriou and Yannakakis [1991] and hard problems for this class include vertex cover, maximum satisfiability, maximum cut, metric TSP, Steiner trees and shortest superstring. We also improve upon the clique hardness results of Feige et al. [1996] and Arora and Safra [1998] and show that there exists a positive ε such that approximating the maximum clique size in an N -vertex graph to within a factor of N ε is NP-hard.Keywords
This publication has 47 references indexed in Scilit:
- On the Hardness of Approximating the Chromatic NumberCombinatorica, 2000
- Linearity testing in characteristic twoIEEE Transactions on Information Theory, 1996
- On the Approximation of Maximum SatisfiabilityJournal of Algorithms, 1994
- PSPACE is provable by two provers in one roundJournal of Computer and System Sciences, 1994
- Self-testing/correcting with applications to numerical problemsJournal of Computer and System Sciences, 1993
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Arithmetization: A new method in structural complexity theorycomputational complexity, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976