Pcp Class

PCP Class is a complexity-theoretic class of decision problems solvable by a probabilistically checkable proof system where the verifier uses a bounded amount of randomness and queries only a constant number of bits of the proof.

71

Publications

3.9K

Citations

178

Authors

89

Institutions

Publications per year

2017–2026

8

Variants

Probabilistically Checkable Proofs Class

Authors

178

  1. MS
    Madhu Sudan

    Massachusetts Institute of Technology, United States

    9 publications · 1.5K citations

    9

    h-index

  2. PH
    Prahladh Harsha

    Tata Institute of Fundamental Research, India

    8 publications · 551 citations

    8

    h-index

  3. SV
    Salil Vadhan

    Harvard University Press, United States

    6 publications · 464 citations

    6

    h-index

  4. OG
    Oded Goldreich

    Weizmann Institute of Science, Israel

    6 publications · 627 citations

    6

    h-index

  5. JH
    Johan Håstad

    KTH Royal Institute of Technology, Sweden

    5 publications · 145 citations

    5

    h-index

1–5 of 178

Venues

  1. Computational Complexity

    CC · 4 publications · 93 citations

    4

    h-index

  2. SIAM Journal on Computing

    3 publications · 313 citations

    3

    h-index

  3. ArXiv.org

    Repository · 2 publications · 30 citations

    2

    h-index

  4. 2

    h-index

  5. Organometallics

    2 publications · 128 citations

    2

    h-index

1–5