Proof verification and the hardness of approximation problems
Work
Year: 1998
Type: article
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... more
Source: Journal of the ACM
Institutions Princeton University, AT&T (United States), Stanford University, Massachusetts Institute of Technology
Cites: 105
Cited by: 1,441
Related to: 10
FWCI: 32.77
Citation percentile (by year/subfield): 99.98
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze