Proof Veritability
Proof Veritability is a formal criterion within proof complexity that characterizes the efficiency and reliability with which a proposed proof can be verified by a computational process, distinguishing it from other proof-related properties by its focus on the intrinsic verifiability of proof steps under bounded resources.
28
Publications
2.9K
Citations
54
Authors
45
Institutions
Publications per year
2017–2026
5
Parents
28
Probabilistic checking of proofs
Sanjeev Arora · Journal of the ACM · 1998 · 1.2K citations · Full text
Silvio Micali · SIAM Journal on Computing · 2000 · 412 citations
Probabilistic checking of proofs; a new characterization of NP
Sanjeev Arora · 1992 · 278 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
1–5 of 28
54
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 54
45
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
5 publications
978 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
4 publications
147 citations

Weizmann Institute of Science
Rehovot, Israel
3 h-index
3 publications
363 citations
Princeton University
Princeton, United States
2 h-index
2 publications
1.2K citations
University of Maryland, College Park
College Park, United States
2 h-index
4 publications
134 citations
Tokyo Institute of Technology
Tokyo, Japan
2 h-index
2 publications
88 citations

KTH Royal Institute of Technology
Stockholm, Sweden
2 h-index
2 publications
120 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
88 citations
1–8 of 45
3 publications · 704 citations
3
h-index
1 publications · 21 citations
1
h-index
1 publications · 11 citations
1
h-index
1 publications · 27 citations
1
h-index
Conference · 1 publications · 31 citations
1
h-index
1–5