Interactive Proof Complexity Classes
Interactive Proof Complexity Classes is a complexity-theoretic classification framework that distinguishes subclasses of problems solvable via interactive protocols between a probabilistic polynomial-time verifier and one or more provers, based on the number of interaction rounds, the amount of randomness, and the computational power of the participants.
26
Publications
955
Citations
43
Authors
31
Institutions
Publications per year
2017–2026
1
Parents
26
Limits on the power of quantum statistical zero-knowledge
John Watrous · 2003 · 113 citations
On the Hardness of Distinguishing Mixed-State Quantum Computations
Bill Rosgen, John Watrous · 2005 · 71 citations
Computing, Computer Science, Physics +14
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
Ruta Jawale, Yael Tauman Kalai, Dakshita Khurana et al. · 2021 · 62 citations
1–5 of 26
43
4
h-index
4
h-index
3
h-index
2
h-index
2
h-index
1–5 of 43
31
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
8 publications
341 citations

University of Calgary
Calgary, Canada
3 h-index
3 publications
200 citations

KTH Royal Institute of Technology
Stockholm, Sweden
3 h-index
3 publications
129 citations
Core Competence
Santa Fe, United States
2 h-index
2 publications
45 citations

University of Waterloo
Waterloo, Canada
2 h-index
2 publications
63 citations
University of Chicago
Chicago, United States
2 h-index
3 publications
99 citations

Weizmann Institute of Science
Rehovot, Israel
2 h-index
2 publications
107 citations
Herzliya Medical Center
Herzliya, Israel
1 h-index
1 publications
26 citations
1–8 of 31
PVLDB · 1 publications · 63 citations
1
h-index
1 publications · 50 citations
1
h-index
IJFCS · 1 publications · 11 citations
1
h-index
1 publications · 10 citations
1
h-index
Repository · 1 publications · 16 citations
1
h-index
1–5