A combinatorial characterization of treelike resolution space
From MaRDI portal
Publication:1014444
DOI10.1016/S0020-0190(03)00345-4zbMath1161.68637MaRDI QIDQ1014444
Juan Luis Esteban, Jacobo Toran
Publication date: 28 April 2009
Published in: Information Processing Letters (Search for Journal in Brave)
68R05: Combinatorics in computer science
Related Items
The depth of resolution proofs, On the complexity of resolution with bounded conjunctions, A characterization of tree-like resolution size
Cites Work
- Unnamed Item
- Unnamed Item
- The intractability of resolution
- Space bounds for resolution
- A combinatorial characterization of resolution width
- On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
- Space Complexity in Propositional Calculus
- Many hard examples for resolution
- Size space tradeoffs for resolution
- Hard examples for resolution
- Short proofs are narrow—resolution made simple
- A Machine-Oriented Logic Based on the Resolution Principle