Proof verification and the hardness of approximation problems

  • Authors:

  • Sanjeev Arora;Carsten Lund;Rajeev Motwani;Madhu Sudan;Mario Szegedy

  • Affiliations:

  • Princeton Univ., Princeton, NJ;AT&T Bell Labs, Murray Hill, NJ;Stanford Univ., Stanford, CA;Massachusetts Institute of Technology, Cambridge;AT&T Bell Labs, Murray Hill, NJ

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1998

Quantified Score

Hi-index 0.03

Visualization

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 &egr; such that approximating the maximum clique size in an N-vertex graph to within a factor of N&egr; is NP-hard.