Probabilistic Proof Systems
Probabilistic Proof Systems is a theoretical framework in computational complexity that enables a verifier to efficiently check the validity of mathematical assertions using randomness and interaction or non-adaptive queries, distinguishing it from deterministic proof systems by allowing probabilistic verification with bounded error.
121
Publications
13.1K
Citations
184
Authors
105
Institutions
Publications per year
2017–2026
17
Parents
121
Approximation Algorithms for NP-Hard Problems
Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text
Probabilistic checking of proofs
Sanjeev Arora · Journal of the ACM · 1998 · 1.2K citations · Full text
Ran Raz · SIAM Journal on Computing · 1998 · 728 citations
Computational complexity: a conceptual perspective
Choice Reviews Online · 2008 · 431 citations
Designing programs that check their work
Manuel Blum, Sampath Kannan · Journal of the ACM · 1995 · 399 citations · Full text
1–5 of 121
184
8
h-index
7
h-index
7
h-index
7
h-index
6
h-index
1–5 of 184
105
Massachusetts Institute of Technology
Cambridge, United States
16 h-index
26 publications
2.3K citations

Weizmann Institute of Science
Rehovot, Israel
12 h-index
13 publications
771 citations
Technion – Israel Institute of Technology
Haifa, Israel
9 h-index
13 publications
436 citations
Princeton University
Princeton, United States
7 h-index
7 publications
1.5K citations
University of California, Berkeley
Berkeley, United States
7 h-index
9 publications
5K citations

Institute for Advanced Study
Princeton, United States
6 h-index
7 publications
354 citations
IIT@MIT
Cambridge, United States
5 h-index
9 publications
262 citations
IBM Research - Almaden
San Jose, United States
5 h-index
6 publications
221 citations
1–8 of 105
7 publications · 1.4K citations
7
h-index
JACM · 5 publications · 1.7K citations
5
h-index
Repository · 4 publications · 152 citations
4
h-index
PACMPL · 3 publications · 60 citations
3
h-index
IJFCS · 2 publications · 82 citations
2
h-index
1–5