Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas

DOI10.1007/978-3-642-31612-8_25zbMath1273.68143OpenAlexW723740MaRDI QIDQ2843337

Ricardo Menchaca-Mendez, Demetrios Achlioptas

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://doi.org/10.1007/978-3-642-31612-8_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas