Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):
St. Szeider:
"The Parameterized Complexity of Constraint Satisfaction and Reasoning";
Hauptvortrag: International Conference on Applications of Declarative Programming and Knowledge Management,
Vienna, Austria (eingeladen);
28.09.2011
- 30.09.2011; in: "19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)",
H. Tompits (Hrg.);
Springer / LNCS,
7773
(2013),
S. 27
- 37.
Kurzfassung englisch:
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.
"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-41524-1
Zugeordnete Projekte:
Projektleitung Stefan Szeider:
The Parameterized Complexity of Reasoning Problems
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.