Small unsatisfiable k-CNFs with bounded literal occurrence

Abstract

Full Citation:

Tianwei Zhang, Tomáš Peitl, Stefan Szeider. Small unsatisfiable k-CNFs with bounded literal occurrence. 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Tianwei Zhang

Tianwei Zhang is a Project Assistant at the Algorithms and Complexity Group.

Tomas Peitl

Tomáš Peitl is a Project Assistant at the Algorithms and Complexity Group.

Stefan Szeider

Head of Research Unit

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