Proof Complexity
Proof Complexity is a branch of theoretical computer science that studies the computational resources required by proof systems to establish the validity of propositional tautologies, particularly focusing on the minimal size or length of proofs relative to the complexity of the statements being proved.
1.6K
Publications
100.7K
Citations
2.2K
Authors
792
Institutions
Publications per year
2017–2026
177
1.6K
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Frank Plumpton Ramsey · Proceedings of the London Mathematical Society · 1930 · 1.9K citations
The knowledge complexity of interactive proof-systems
Sbafi Goldwasser, Silvio Micali, Charles Rackoff · 1985 · 1.2K citations · Full text
Probabilistic checking of proofs
Sanjeev Arora · Journal of the ACM · 1998 · 1.2K citations · Full text
1–5 of 1.6K
2.2K
20
h-index
18
h-index
16
h-index
14
h-index
14
h-index
1–5 of 2.2K
792

Weizmann Institute of Science
Rehovot, Israel
31 h-index
60 publications
9.3K citations
Massachusetts Institute of Technology
Cambridge, United States
28 h-index
67 publications
6.8K citations

Centre National de la Recherche Scientifique
Paris, France
27 h-index
80 publications
3.4K citations

University of Toronto
Toronto, Canada
27 h-index
61 publications
11K citations
University of California San Diego
San Diego, United States
26 h-index
43 publications
3.1K citations
Microsoft (United States)
Redmond, United States
25 h-index
30 publications
2.2K citations
Technion – Israel Institute of Technology
Haifa, Israel
21 h-index
48 publications
3.2K citations
Princeton University
Princeton, United States
21 h-index
36 publications
3.4K citations
1–8 of 792
78 publications · 3.9K citations
32
h-index
54 publications · 2.6K citations
26
h-index
31 publications · 4K citations
25
h-index
44 publications · 1.7K citations
25
h-index
24 publications · 3.9K citations
24
h-index
1–5