Exponential separation between and for
References (6)
- et al.
On the automatizability of resolution and related propositional proof systems
Inform. Comput.
(2004) Unrestricted resolution versus N-resolution
Theoret. Comput. Sci.
(1992)- et al.
A switching lemma for small restrictions and lower bounds for k-DNF resolution
SIAM J. Comput.
(2004)
There are more references available in the full text version of this article.
Cited by (4)
The treewidth of proofs
2017, Information and ComputationPebble games, proof complexity, and time-space trade-offs
2013, Logical Methods in Computer ScienceOn minimal unsatisfiability and time-space trade-offs for k-DNF resolution
2011, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)The complexity of propositional proofs
2007, Bulletin of Symbolic Logic
- 1
Supported by NSF grant DMS-0303258.
Copyright © 2004 Elsevier B.V. All rights reserved.