Stefan Andrei, Gheorghe Grigoras, Martin C. Rinard, Roland H. C. Yap. A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems. In Stephen M. Watt, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Daniela Zaharie, editors, 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2009, Timisoara, Romania, September 26-29, 2009. pages 61-68, IEEE Computer Society, 2009. [doi]
@inproceedings{AndreiGRY09,
title = {A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems},
author = {Stefan Andrei and Gheorghe Grigoras and Martin C. Rinard and Roland H. C. Yap},
year = {2009},
doi = {10.1109/SYNASC.2009.12},
url = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2009.12},
researchr = {https://researchr.org/publication/AndreiGRY09},
cites = {0},
citedby = {0},
pages = {61-68},
booktitle = {11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2009, Timisoara, Romania, September 26-29, 2009},
editor = {Stephen M. Watt and Viorel Negru and Tetsuo Ida and Tudor Jebelean and Dana Petcu and Daniela Zaharie},
publisher = {IEEE Computer Society},
isbn = {978-1-4244-5910-0},
}