Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
proof length
Description:
A measure of the size of a formal proof, commonly quantified by its number of symbols, steps, or inferences in proof complexity.
Primary topic:
Complexity and Algorithms in Graphs (21%)
Related topics:
Complexity and Algorithms in Graphs (21%),
Logic, programming, and type systems (20%),
Computability, Logic, AI Algorithms (14%)
OpenAlex ID:
keywords/proof-length
The relative efficiency of propositional proof systems
1979
·
Stephen A. Cook
, Robert A. Reckhow
·
Journal of Symbolic Logic
·
1,056
The intractability of resolution
1985
·
Armin Haken
·
Theoretical Computer Science
·
984
PDF
Super-Exponential Complexity of Presburger Arithmetic
1998
·
Michael J. Fischer
, Michael O. Rabin
·
Texts & monographs in symbolic computation/Texts and monographs in symbolic computation
·
349
PDF
Handbook of Proof Theory
1998
·
Buss, Samuel R.
·
Studies in logic and the foundations of mathematics
·
332
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
2006
·
Eli Ben‐Sasson
, Oded Goldreich
, et al.
·
SIAM Journal on Computing
·
313
An Efficient Scheme for Proving a Shuffle
2001
·
Jun Furukawa
, Kazue Sako
·
Lecture notes in computer science
·
272
Propositional proof systems, the consistency of first order theories and the complexity of computations
1989
·
Jan Krajíček
, Pavel Pudlák
·
Journal of Symbolic Logic
·
230
The Classification of Finite Simple Groups
1983
·
Daniel Gorenstein
·
Springer eBooks
·
170
The Lengths of Proofs
1998
·
Pavel Pudlák
·
Studies in logic and the foundations of mathematics
·
166
On the lengths of proofs in the propositional calculus.
1976
·
Robert A. Reckhow
·
TSpace (University of Toronto)
·
158
Arithmetic, proof theory, and computational complexity
1993
·
157
Easy problems are sometimes hard
1994
·
Ian P. Gent
, Toby Walsh
·
Artificial Intelligence
·
139
Complexity of Null- and Positivstellensatz proofs
2001
·
Dima Grigoriev
, Nicolai Vorobjov
·
Annals of Pure and Applied Logic
·
132
PDF
On the lengths of proofs in the propositional calculus (Preliminary Version)
1974
·
Stephen Cook
, Robert Reckhow
·
ACM Symposium on Theory of Computing (STOC)
·
126
PDF
Resolution lower bounds for the weak pigeon hole principle
2002
·
Ran Raz
·
IEEE Conference on Computational Complexity (CCC)
·
116
The psychology of knights and knaves
1989
·
Lance J. Rips
·
Cognition
·
114
A short proof of the pigeon hole principle using extended resolution
1976
·
Stephen A. Cook
·
ACM SIGACT News
·
109
PDF
Non-Interactive Zero-Knowledge for Blockchain: A Survey
2020
·
Juha Partala
, Tri Hong Nguyen
, et al.
·
IEEE Access
·
103
PDF
Some Results on the Length of Proofs
1973
·
R. J. Parikh
·
Transactions of the American Mathematical Society
·
97
PDF
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution
2008
·
Eli Ben-Sasson
, Jakob Nordström
·
Annual Symposium on Foundations of Computer Science
·
94
The undecidability of k-provability
1991
·
Samuel R. Buss
·
Annals of Pure and Applied Logic
·
88
PDF
An optimality result for clause form translation
1992
·
Thierry Boy de la Tour
·
Journal of Symbolic Computation
·
83
PDF
On the length of proofs of finitistic consistency statements in first order theories
1986
·
Pavel Pudlák
·
Studies in logic and the foundations of mathematics
·
82
Hierarchies of Provably Recursive Functions
1998
·
Matt Fairtlough
, Stanley S. Wainer
·
Studies in logic and the foundations of mathematics
·
80
Proof Complexity of Resolution-based QBF Calculi
2015
·
Beyersdorff, Olaf
, Chew, Leroy
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
79
PDF
Show more works
View as search
Works count:
307
Citation count:
8,193
Year
Topic
Type