Randomized Proof Systems is a class of probabilistic proof verification models in proof complexity that extend classical proof systems by allowing randomized checking of proofs, thereby distinguishing themselves through the use of randomness to achieve possibly more efficient verification with bounded error probability.
51
Publications
6.4K
Citations
103
Authors
64
Institutions
Publications per year
2017–2026
8
Parents
Publications
51
Ran Raz · SIAM Journal on Computing · 1998 · 728 citations
Adi Shamir · Journal of the ACM · 1992 · 657 citations · Full text
Interactive proofs and the hardness of approximating cliques
Uriel Feige, Shafi Goldwasser, László Lovász et al. · Journal of the ACM · 1996 · 524 citations · Full text
1–5 of 51
Authors
103
- UF
7
h-index
- RR
3
h-index
- CL
3
h-index
- YT
3
h-index
- LL
3
h-index
1–5 of 103
Institutions
64
Weizmann Institute of Science
Rehovot, Israel
9 h-index
12 publications
2.2K citations
IBM (United States)
Armonk, United States
7 h-index
8 publications
928 citations
Eötvös Loránd University
Budapest, Hungary
3 h-index
3 publications
949 citations
IBM Research - Almaden
San Jose, United States
3 h-index
4 publications
107 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
643 citations
Princeton University
Princeton, United States
3 h-index
3 publications
240 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
2 publications
286 citations
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
32 citations
1–8 of 64
Venues
- Journal of Computer and System Sciences
3 publications · 716 citations
3
h-index
- Journal of the ACM
JACM · 3 publications · 1.3K citations
3
h-index
- IACR Cryptology ePrint Archive
Repository · 2 publications · 207 citations
2
h-index
- SIAM Journal on Computing
2 publications · 773 citations
2
h-index
- Journal of Symbolic Computation
1 publications · 210 citations
1
h-index
1–5