Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
(Bog, Paperback / softback, Engelsk)
Beskrivelse
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.
Læsernes anmeldelser (0)
Alle detaljer
| Forlag | Springer-Verlag Berlin and Heidelberg GmbH & Co. KG |
| Forfatter | Ronald de Haan |
| Type | Bog |
| Format | Paperback / softback |
| Sprog | Engelsk |
| Udgave | 2019 ed. |
| Udgivelsesdato | 31-12-2019 |
| Første udgivelsesår | 2019 |
| Serie | Lecture Notes in Computer Science |
| Illustrationer | 1349 Illustrations, black and white |
| Originalsprog | Germany |
| Sideantal | 398 |
| Indbinding | Paperback / softback |
| Forlag | Springer-Verlag Berlin and Heidelberg GmbH & Co. KG |
| Sideoplysninger | 398 pages, 1349 Illustrations, black and white |
| Mål | 234 x 156 x 27 |
| ISBN-13 / EAN-13 | 9783662606698 |