Parameterized Complexity in the Polynomial Hierarchy. Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy, 2019 ed., Paperback/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. Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Author(s): Ronald de Haan Illustration(s): 1349 Illustrations, black and white; XI, 398 p. 1349 illus. Number of pages: 398 Collection: Theoretical Computer Science and General Issues Publication date: 2019 Dimensions: 234 x 156 x 27 Cover type: Paperback / softback