Parameterized Complexity in the Polynomial Hierarchy
Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
Description
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.
I have a question about the book:
‘Parameterized Complexity in the Polynomial Hierarchy - de Haan, Ronald’.
Fill in the form below.
We will respond as fast as possible.
