Probabilistic checking of proofs-Reference-Cited by-同舟云学术

Probabilistic checking of proofs

Published:1998-01 Issue:1 Volume:45 Page:70-122
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Arora Sanjeev¹,Safra Shmuel²

Affiliation:

1. Princeton Univ., Princeton, NJ

2. Tel-Aviv Univ., Tel-Aviv, Israel

Abstract

We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L ) can be verified probabilistically in polynomial time using logarithmic number of random bits and by reading sublogarithmic number of bits from the proof. We discuss implications of this characterization; specifically, we show that approximating Clique and Independent Set, even in a very weak sense, is NP-hard.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/273865.273901

Reference55 articles.

1. Simple constructions of almost k-wise independent random variables;ALON N.;Rand. Struct. Algor.,1992

Cited by 649 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Parameterized Intractability of Determinant Maximization;Algorithmica;2024-02-03

2. Guest Column: The 7 faces of quantum NP;ACM SIGACT News;2023-12-29

3. Delegable zk-SNARKs with proxies;Frontiers of Computer Science;2023-12-23

4. A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification;SIAM Journal on Computing;2023-12-06

5. Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06