Dimitris Achlioptas, Ricardo Menchaca-Mendez. Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas. In Alessandro Cimatti, Roberto Sebastiani, editors, Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings. Volume 7317 of Lecture Notes in Computer Science, pages 327-340, Springer, 2012. [doi]
@inproceedings{AchlioptasM12-0,
title = {Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas},
author = {Dimitris Achlioptas and Ricardo Menchaca-Mendez},
year = {2012},
doi = {10.1007/978-3-642-31612-8_25},
url = {http://dx.doi.org/10.1007/978-3-642-31612-8_25},
researchr = {https://researchr.org/publication/AchlioptasM12-0},
cites = {0},
citedby = {0},
pages = {327-340},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
editor = {Alessandro Cimatti and Roberto Sebastiani},
volume = {7317},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-31611-1},
}