Size space tradeoffs for resolution
From MaRDI portal
Publication:3579186
DOI10.1145/509907.509975zbMath1192.03040OpenAlexW1997338813MaRDI QIDQ3579186
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509975
Related Items (6)
On the complexity of resolution with bounded conjunctions ⋮ Regular and General Resolution: An Improved Separation ⋮ The depth of resolution proofs ⋮ Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs ⋮ Space proof complexity for random 3-CNFs ⋮ A combinatorial characterization of treelike resolution space
This page was built for publication: Size space tradeoffs for resolution
