Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP

Abstract

Full Citation:

Ronald de Haan, Stefan Szeider. Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sn\ve\vzkou, Czech Republic, January 24-29, 2015. Proceedings, volume 8939 of Lecture Notes in Computer Science, pages 217-229, 1 2015, Springer Verlag.

Stefan Szeider

Head of Research Unit

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