A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.