Gå direkte til innholdet
Parameterized Complexity in the Polynomial Hierarchy
Spar

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.
Undertittel
Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
Opplag
2019 ed.
ISBN
9783662606698
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
31.12.2019
Antall sider
398