Theoretical Computer Science and General Issues

Parameterized Complexity in the Polynomial Hierarchy

Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

Authors: de Haan, Ronald

Free Preview
  • Fixed-parameter tractable reductionsParameterized complexity Polynomial HierarchyComputational Complexity

Buy this book

eBook 60,98 €
price for Spain (gross)
  • ISBN 978-3-662-60670-4
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 76,95 €
price for Spain (gross)
  • ISBN 978-3-662-60669-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
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.

About the authors

Ronald de Haan is a postdoctoral researcher at the Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam.

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.

Table of contents (17 chapters)

Table of contents (17 chapters)

Buy this book

eBook 60,98 €
price for Spain (gross)
  • ISBN 978-3-662-60670-4
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 76,95 €
price for Spain (gross)
  • ISBN 978-3-662-60669-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Parameterized Complexity in the Polynomial Hierarchy
Book Subtitle
Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
Authors
Series Title
Theoretical Computer Science and General Issues
Series Volume
11880
Copyright
2019
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag GmbH Germany, part of Springer Nature
eBook ISBN
978-3-662-60670-4
DOI
10.1007/978-3-662-60670-4
Softcover ISBN
978-3-662-60669-8
Edition Number
1
Number of Pages
XI, 398
Number of Illustrations
1349 b/w illustrations
Topics