| 书目名称 | Parameterized Complexity in the Polynomial Hierarchy |
| 副标题 | Extending Parameteri |
| 编辑 | Ronald de Haan |
| 视频video | |
| 概述 | Fixed-parameter tractable reductions.Parameterized complexity.Polynomial Hierarchy.Computational Complexity |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | .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.. |
| 出版日期 | Book 2019 |
| 关键词 | Computational complexity; Parameterized complexity; Fixed-parameter tractability; Fpt-reductions; Polyno |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-662-60670-4 |
| isbn_softcover | 978-3-662-60669-8 |
| isbn_ebook | 978-3-662-60670-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag GmbH Germany, part of Springer Nature 2019 |
发表于 2025-3-21 18:05:04
