The Parameterized Complexity of Reasoning Problems Beyond NP

Abstract

Full Citation:

de Haan, Ronald, Stefan Szeider. The Parameterized Complexity of Reasoning Problems Beyond NP. Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 (Chitta Baral and Giuseppe De Giacomo and Thomas Eiter), pages 82-91, 2014, AAAI Press.

Stefan Szeider
Stefan Szeider
Head of Research Unit

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