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

Authors

43

  1. JW
    John Watrous

    University of Calgary, Canada

    4 publications · 239 citations

    4

    h-index

  2. JH
    Johan Håstad

    KTH Royal Institute of Technology, Sweden

    4 publications · 175 citations

    4

    h-index

  3. LB
    László Babai

    University of Chicago, United States

    3 publications · 117 citations

    3

    h-index

  4. GC
    Graham Cormode

    AT&T (United States), United States

    2 publications · 73 citations

    2

    h-index

  5. TV
    Thomas Vidick

    California Institute of Technology, United States

    2 publications · 95 citations

    2

    h-index

1–5 of 43

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 63 citations

    1

    h-index

  2. SIAM Journal on Discrete Mathematics

    1 publications · 50 citations

    1

    h-index

  3. International Journal of Foundations of Computer Science

    IJFCS · 1 publications · 11 citations

    1

    h-index

  4. 1

    h-index

  5. ArXiv.org

    Repository · 1 publications · 16 citations

    1

    h-index

1–5