An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning

DOI10.1007/978-3-642-31612-8_5zbMath1273.03048arXiv1202.2296OpenAlexW2124685959WikidataQ60512095 ScholiaQ60512095MaRDI QIDQ2843321

Maria Luisa Bonet, Samuel R. Buss

Publication date: 12 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.2296

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Related Items (4)

Towards NP-P via proof complexity and search ⋮ A note on SAT algorithms and proof complexity ⋮ Producing and verifying extremely large propositional refutations ⋮ On Linear Resolution

This page was built for publication: An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning