Size space tradeoffs for resolution
From MaRDI portal
Publication:3579186
DOI10.1145/509907.509975zbMath1192.03040MaRDI 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
03F20: Complexity of proofs
Related Items
The depth of resolution proofs, A combinatorial characterization of treelike resolution space, On the complexity of resolution with bounded conjunctions, Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs, Space proof complexity for random 3-CNFs, Regular and General Resolution: An Improved Separation