Joshua Buresh-Oppenheim, David G. Mitchell. Minimum 2CNF Resolution Refutations in Polynomial Time. In João Marques-Silva, Karem A. Sakallah, editors, Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings. Volume 4501 of Lecture Notes in Computer Science, pages 300-313, Springer, 2007. [doi]
@inproceedings{Buresh-OppenheimM07,
title = {Minimum 2CNF Resolution Refutations in Polynomial Time},
author = {Joshua Buresh-Oppenheim and David G. Mitchell},
year = {2007},
doi = {10.1007/978-3-540-72788-0_29},
url = {http://dx.doi.org/10.1007/978-3-540-72788-0_29},
researchr = {https://researchr.org/publication/Buresh-OppenheimM07},
cites = {0},
citedby = {0},
pages = {300-313},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings},
editor = {João Marques-Silva and Karem A. Sakallah},
volume = {4501},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-72787-3},
}