Szeider, S. (2013). The Parameterized Complexity of Constraint Satisfaction and Reasoning. In H. Tompits, S. Abreu, J. Oetsch, J. Pührer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 27–37). Springer / LNCS. https://doi.org/10.1007/978-3-642-41524-1_2
E192-03 - Forschungsbereich Knowledge Based Systems
-
Published in:
Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers
International Conference on Applications of Declarative Programming and Knowledge Management
-
Event date:
28-Sep-2011 - 30-Sep-2011
-
Event place:
Vienna, Austria, Austria
-
Number of Pages:
11
-
Publisher:
Springer / LNCS, 7773
-
Publisher:
Springer, LNAI
-
Abstract:
Parameterized Complexity is a new and increasingly popular theoretical framework for the rigorous analysis of NP-hard problems and the development of algorithms for their solution. The framework provides adequate concepts for taking structural aspects of problem instances into account. We outline the basic concepts of Parameterized Complexity and survey some recent parameterized complexity results on problems arising in Constraint Satisfaction and Reasoning.
en
Project title:
The Parameterized Complexity of Reasoning Problems: 239962 (Europäischer Forschungsrat (ERC))
