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

Authors

184

  1. MS
    Madhu Sudan

    Massachusetts Institute of Technology, United States

    8 publications · 666 citations

    8

    h-index

  2. OG
    Oded Goldreich

    Weizmann Institute of Science, Israel

    7 publications · 549 citations

    7

    h-index

  3. EB
    Eli Ben‐Sasson

    Technion – Israel Institute of Technology, Israel

    7 publications · 528 citations

    7

    h-index

  4. JH
    Johan Håstad

    KTH Royal Institute of Technology, Sweden

    7 publications · 267 citations

    7

    h-index

  5. PH
    Prahladh Harsha

    Tata Institute of Fundamental Research, India

    6 publications · 505 citations

    6

    h-index

1–5 of 184

Venues

  1. SIAM Journal on Computing

    7 publications · 1.4K citations

    7

    h-index

  2. Journal of the ACM

    JACM · 5 publications · 1.7K citations

    5

    h-index

  3. IACR Cryptology ePrint Archive

    Repository · 4 publications · 152 citations

    4

    h-index

  4. Proceedings of the ACM on Programming Languages

    PACMPL · 3 publications · 60 citations

    3

    h-index

  5. International Journal of Foundations of Computer Science

    IJFCS · 2 publications · 82 citations

    2

    h-index

1–5