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
Parents
71
Proof verification and hardness of approximation problems
Sanjeev Arora, Carsten Lund, R. Motwani et al. · 1992 · 744 citations
Toward a Unified Theory of the CSP–CFP Link
Isaiah Yeshayahu Marom · Journal of Business Ethics · 2006 · 240 citations
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
Eli Ben‐Sasson, Oded Goldreich, Prahladh Harsha et al. · SIAM Journal on Computing · 2006 · 240 citations · Full text
Zhengfeng Ji, Anand Natarajan, Thomas Vidick et al. · Communications of the ACM · 2021 · 167 citations · Full text
1–5 of 71
178
9
h-index
8
h-index
6
h-index
6
h-index
5
h-index
1–5 of 178
89

Weizmann Institute of Science
Rehovot, Israel
11 h-index
19 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
10 h-index
19 publications
1.5K citations
Technion – Israel Institute of Technology
Haifa, Israel
6 h-index
8 publications
330 citations
Harvard University
Cambridge, United States
5 h-index
5 publications
452 citations

KTH Royal Institute of Technology
Stockholm, Sweden
5 h-index
5 publications
145 citations

Institute for Advanced Study
Princeton, United States
5 h-index
7 publications
306 citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
6 publications
407 citations
Princeton University
Princeton, United States
4 h-index
4 publications
68 citations
1–8 of 89
CC · 4 publications · 93 citations
4
h-index
3 publications · 313 citations
3
h-index
Repository · 2 publications · 30 citations
2
h-index
2 publications · 36 citations
2
h-index
2 publications · 128 citations
2
h-index
1–5