Computing unsatisfiable k-SAT instances with few occurrences per variable

Abstract

Full Citation:

Hoory, Shlomo, Szeider, Stefan. Computing unsatisfiable k-SAT instances with few occurrences per variable. Theoretical Computer Science, volume 337, number 1-3, pages 347-359, 2005. (Note: Supplementary material is available at https://www.ac.tuwien.ac.at/files/pub/HoorySzeider05.tar.gz)

Stefan Szeider

Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.