Siirry suoraan sisältöön
Parameterized Complexity in the Polynomial Hierarchy
Tallenna

Parameterized Complexity in the Polynomial Hierarchy

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.
Alaotsikko
Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
Kirjailija
Ronald de Haan
Painos
2019 ed.
ISBN
9783662606698
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
31.12.2019
Sivumäärä
398