Neu Erschienen: 01.01.2020 Abbildung von de Haan | Parameterized Complexity in the Polynomial Hierarchy | 1st ed. 2019 | 2019 | Extending Parameterized Comple...

de Haan

Parameterized Complexity in the Polynomial Hierarchy

Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

lieferbar ca. 10 Tage als Sonderdruck ohne Rückgaberecht

1st ed. 2019 2019. Buch. xi, 398 S. 1349 s/w-Abbildungen, Bibliographien. Softcover

Springer. ISBN 978-3-662-60669-8

Format (B x L): 15,5 x 23,5 cm

Gewicht: 622 g

In englischer Sprache


The book presents the 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.


  • Dieses Set enthält folgende Produkte:
      Auch in folgendem Set erhältlich:
      • nach oben

        Ihre Daten werden geladen ...