Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable

Abstract

Full Citation:

Shlomo Hoory, Stefan Szeider. Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004.

Stefan Szeider

Head of Research Unit

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