A note on SAT algorithms and proof complexity
Highlights
► Lengths-of-proofs lower bounds yield formulas hard for SAT algorithms. ► Lower bounds for a proof system are a form of consistency of “P differs from NP”. ► The soundness statements for a SAT algorithm yield hard satisfiable formulas.
References (19)
- et al.
On the automatizability of resolution and related propositional proof systems
Information and Computation
(2004) Towards NP–P via proof complexity and search
Annals of Pure and Applied Logic
(2012)The lengths of proofs
- et al.
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
- et al.
Clause-learning algorithms with many restarts and bounded-width resolution
J. of Artificial Intelligence Research
(2011) - et al.
Towards understanding and harnessing the potential of clause learning
J. of Artificial Intelligence Research
(2004) - A. Bogdanov, K. Talwar, A. Wan, Hard instances for satisfiability and quasi-one-way functions, in: Proc. of the First...
- M.L. Bonet, S.R. Buss, An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning,...
Bounded Arithmetic
(1986)
There are more references available in the full text version of this article.
Cited by (7)
INFORMATION in PROPOSITIONAL PROOFS and ALGORITHMIC PROOF SEARCH
2022, Journal of Symbolic LogicProof complexity
2019, Proof ComplexityA remark on pseudo proof systems and hard instances of the satisfiability problem
2018, Mathematical Logic QuarterlyHard instances of algorithms and proof systems
2014, ACM Transactions on Computation TheoryOn the computational complexity of finding hard tautologies
2014, Bulletin of the London Mathematical Society
- 1
Supported in part by grants IAA100190902 and MSM0021620839. Also partially affiliated with the Institute of Mathematics of the Academy of Sciences and grant AV0Z10190503.
Copyright © 2012 Elsevier B.V. All rights reserved.