<div class="csl-bib-body">
<div class="csl-entry">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.), <i>Applications of Declarative Programming and Knowledge Management</i> (pp. 27–37). Springer / LNCS. https://doi.org/10.1007/978-3-642-41524-1_2</div>
</div>
-
dc.identifier.isbn
9783642415241
-
dc.identifier.isbn
9783642415234
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/54886
-
dc.description.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
dc.description.sponsorship
Europäischer Forschungsrat (ERC)
-
dc.publisher
Springer / LNCS
-
dc.relation.ispartofseries
Lecture Notes in Computer Science
-
dc.title
The Parameterized Complexity of Constraint Satisfaction and Reasoning
-
dc.type
Konferenzbeitrag
de
dc.type
Inproceedings
en
dc.relation.publication
Applications of Declarative Programming and Knowledge Management
-
dc.relation.isbn
978-3-642-41523-4
-
dc.relation.doi
10.1007/978-3-642-41524-1
-
dc.relation.issn
0302-9743
-
dc.description.startpage
27
-
dc.description.endpage
37
-
dc.relation.grantno
239962
-
dc.type.category
Keynote Contribution
-
dc.relation.eissn
1611-3349
-
dc.publisher.place
7773
-
tuw.booktitle
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
-
tuw.container.volume
7773
-
tuw.relation.publisher
Springer, LNAI
-
tuw.book.chapter
2
-
tuw.project.title
The Parameterized Complexity of Reasoning Problems
-
tuw.publication.orgunit
E192-03 - Forschungsbereich Knowledge Based Systems
-
tuw.publisher.doi
10.1007/978-3-642-41524-1_2
-
dc.description.numberOfPages
11
-
tuw.event.name
International Conference on Applications of Declarative Programming and Knowledge Management
-
tuw.event.startdate
28-09-2011
-
tuw.event.enddate
30-09-2011
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Vienna, Austria
-
tuw.event.place
Vienna, Austria
-
tuw.event.country
AT
-
tuw.event.presenter
Szeider, Stefan
-
wb.sciencebranch
Mathematik, Informatik
-
wb.sciencebranch.oefos
11
-
wb.presentation.type
science to science/art to art
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
item.openairetype
Konferenzbeitrag
-
item.openairetype
Inproceedings
-
item.cerifentitytype
Publications
-
item.cerifentitytype
Publications
-
crisitem.project.funder
Europäischer Forschungsrat (ERC)
-
crisitem.project.grantno
239962
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
