Titlebook: Parameterized Complexity in the Polynomial Hierarchy; Extending Parameteri Ronald de Haan Book 2019 Springer-Verlag GmbH Germany, part of S

Charitable

Problems in Judgment Aggregationce—this is a continuation of our parameterized complexity investigation of problems at higher levels of the Polynomial Hierarchy using the parameterized complexity tools that we developed in Chaps.?.–..

Extemporize

柔美流暢

狗舍

Parameterized Complexity in the Polynomial Hierarchy978-3-662-60670-4Series ISSN 0302-9743 Series E-ISSN 1611-3349

救護車

抵消

Parameterized Complexity TheoryIn Chapt.?., we went over some of the central notions and results from the theory of classical complexity, that play a role in this thesis. In this chapter, we will give a similar overview of the area of parameterized complexity theory.

嫻熟

Fpt-Reducibility to SATIn the traditional parameterized complexity literature, the concept of fixed-parameter tractability is commonly used as a desideratum for algorithms that solve a particular problem in its entirety (i.e., fpt-algorithms) [27, 66, 67, 85, 166].

circumvent

The Need for a New Completeness TheoryIn Chap.?., we showed that known parameterized complexity classes such as . and . can be used to characterize many-to-one fpt-reductions to SAT and UNSAT.

projectile

A New Completeness TheoryIn Chapter?., we identified several natural parameterized variants of our running example (the consistency problem for disjunctive answer set programming) whose complexity cannot be adequately characterized using the known parameterized complexity classes.

Oratory

Fpt-Algorithms with Access to a SAT Oraclewe introduced the idea of fpt-reductions to SAT