Regular and General Resolution: An Improved Separation
From MaRDI portal
Publication:3502715
DOI10.1007/978-3-540-79719-7_26zbMath1138.68530OpenAlexW1553707512MaRDI QIDQ3502715
Publication date: 27 May 2008
Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_26
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Near optimal seperation of tree-like and general resolution
- Short proofs for tricky formulas
- Optimality of size-width tradeoffs for resolution
- Short resolution proofs for a sequence of tricky formulas
- Regular Resolution Versus Unrestricted Resolution
- Size space tradeoffs for resolution
- A DNF without Regular Shortest Consensus Path
- Space bounds for a game on graphs
- Tail bounds for occupancy and the satisfiability threshold conjecture
- The Complexity of Propositional Proofs
- A machine program for theorem-proving
This page was built for publication: Regular and General Resolution: An Improved Separation
