Search Problems in the Decision Tree Model
SIAM Journal on Discrete Mathematics
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Space complexity in propositional calculus
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Information and Computation
An exponential separation between regular and general resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Models of Computation: Exploring the Power of Computing
Models of Computation: Exploring the Power of Computing
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
SIAM Journal on Computing
On the Complexity of Resolution with Bounded Conjunctions
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Regular and general resolution: an improved separation
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Complexity issues related to propagation completeness
Artificial Intelligence
| Hi-index | 0.00 |
This paper investigates the depth of resolution proofs, that is to say, the length of the longest path in the proof from an input clause to the conclusion. An abstract characterization of the measure is given, as well as a discussion of its relation to other measures of space complexity for resolution proofs