Up a level |
Jump to: 2009
Number of items: 1.
2009
Johannsen, D. and Razgon, Igor and Wahlström, M. (2009) Solving SAT for CNF formulas with a one-sided restriction on variable occurrences. In: Kullmann, O. (ed.) Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science 5584. Berlin, Germany: Springer Verlag, pp. 80-85. ISBN 9783642027765.