Vertel uw vrienden over dit artikel:
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 | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 31 december 2019 |
| ISBN13 | 9783662606698 |
| Uitgevers | Springer-Verlag Berlin and Heidelberg Gm |
| Pagina's | 398 |
| Afmetingen | 156 × 234 × 27 mm · 624 g |
| Taal en grammatica | Duits |
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld