Tell your friends about this item:
Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy - Lecture Notes in Computer Science Ronald De Haan 2019 edition
Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy - Lecture Notes in Computer Science
Ronald De Haan
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.
398 pages, 1349 Illustrations, black and white; XI, 398 p. 1349 illus.
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | December 31, 2019 |
| ISBN13 | 9783662606698 |
| Publishers | Springer-Verlag Berlin and Heidelberg Gm |
| Pages | 398 |
| Dimensions | 156 × 234 × 27 mm · 624 g |
| Language | German |