Parameterized and subexponential-time complexity of satisfiability problems and applications

Abstract

Full Citation:

Iyad A. Kanj, Stefan Szeider. Parameterized and subexponential-time complexity of satisfiability problems and applications. Theoretical Computer Science, volume 607, pages 282-295, 2015.

Stefan Szeider

Head of Research Unit

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