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 666 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Injective hardness condition for PCSPs;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Local consistency as a reduction between constraint satisfaction problems;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

3. Algebraic Approach to Approximation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

4. Local Proofs Approaching the Witness Length;Journal of the ACM;2024-06-11

5. Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10