Probabilistically Checkable Proofs
Probabilistically Checkable Proofs is a computational proof system in which a probabilistic verifier can check the validity of a proof by examining only a constant number of bits from it, with high confidence, distinguishing correct proofs from incorrect ones with high probability based on limited, randomized queries.
74
Publications
7K
Citations
97
Authors
59
Institutions
Publications per year
2017–2026
6
74
Probabilistic checking of proofs
Sanjeev Arora · Journal of the ACM · 1998 · 1.2K citations · Full text
Zero Knowledge and the Chromatic Number
Uriel Feige, Joe Kilian · Journal of Computer and System Sciences · 1998 · 335 citations
Efficient probabilistically checkable proofs and applications to approximations
Mihir Bellare, S. Goldwasser, Carsten Lund et al. · 1993 · 318 citations
1–5 of 74
97
13
h-index
13
h-index
6
h-index
6
h-index
6
h-index
1–5 of 97
59
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
18 publications
1.8K citations
University of California, Berkeley
Berkeley, United States
12 h-index
12 publications
1.3K citations
Technion – Israel Institute of Technology
Haifa, Israel
11 h-index
21 publications
543 citations

Institute for Advanced Study
Princeton, United States
8 h-index
10 publications
423 citations

Weizmann Institute of Science
Rehovot, Israel
8 h-index
8 publications
973 citations
Princeton University
Princeton, United States
8 h-index
10 publications
1.6K citations
Harvard University
Cambridge, United States
5 h-index
6 publications
708 citations
AT&T (United States)
Bedminster, United States
5 h-index
9 publications
451 citations
1–8 of 59
13 publications · 1.6K citations
13
h-index
JACM · 3 publications · 1.4K citations
3
h-index
Repository · 3 publications · 71 citations
3
h-index
Repository · 3 publications · 182 citations
3
h-index
Repository · 2 publications · 51 citations
2
h-index
1–5