Gå direkt till innehållet
Parameterized Complexity in the Polynomial Hierarchy
Spara

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.
Undertitel
Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
Författare
Ronald de Haan
Upplaga
2019 ed.
ISBN
9783662606698
Språk
Engelska
Vikt
310 gram
Utgivningsdatum
31.12.2019
Sidor
398