Overview
- Fixed-parameter tractable reductions
- Parameterized complexity
- Polynomial Hierarchy
- Computational Complexity
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11880)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (17 chapters)
-
Front Matter
-
Foundations
-
Front Matter
-
-
Relation to Other Topics in Complexity Theory
-
Front Matter
-
Keywords
About this book
Parameterized Complexity in the Polynomial Hierarchy was co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy (PH). For problems at higher levels of the PH, a promising solving approach is to develop fixed-parameter tractable reductions to SAT, and to subsequently use a SAT solving algorithm to solve the problem. In this dissertation, a theoretical toolbox is developed that can be used to classify in which cases this is possible. The use of this toolbox is illustrated by applying it to analyze a wide range of problems from various areas of computer science and artificial intelligence.
Authors and Affiliations
About the author
His research interests include the application of methods from theoretical computer science—in particular methods from (parameterized) complexity theory—to problems in computational logic, artificial intelligence (AI), and knowledge representation & reasoning (KRR).
He wrote his PhD thesis—titled Parameterized Complexity in the Polynomial Hierarchy—at the Algorithms and Complexity Group at the Faculty of Informatics of the Technische Universität Wien. He received his PhD in 2016. His PhD thesis was awarded the E.W. Beth Dissertation Prize 2017, was shortlisted for the Heinz Zemanek Prize 2018, and was nominated for the GI-Dissertationspreis 2016 of the German Informatics Society.
Bibliographic Information
Book Title: Parameterized Complexity in the Polynomial Hierarchy
Book Subtitle: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
Authors: Ronald de Haan
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-662-60670-4
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag GmbH Germany, part of Springer Nature 2019
Softcover ISBN: 978-3-662-60669-8Published: 31 December 2019
eBook ISBN: 978-3-662-60670-4Published: 30 December 2019
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 398
Number of Illustrations: 1349 b/w illustrations
Topics: Mathematical Logic and Foundations, Mathematical Logic and Formal Languages