Parameterized Complexity in the Polynomial Hierarchy di Ronald de Haan edito da Springer Berlin Heidelberg
Alta reperibilità

Parameterized Complexity in the Polynomial Hierarchy

Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

EAN:

9783662606698

ISBN:

3662606690

Pagine:
412
Formato:
Paperback
Lingua:
Tedesco
Acquistabile con o la

Descrizione Parameterized Complexity in the Polynomial Hierarchy

Parameterized Complexity in the Polynomial Hierarchy was co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy (PH). 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. In this dissertation, a theoretical toolbox is developed that can be used to classify in which cases this is possible. The use of this toolbox is illustrated by applying it to analyze a wide range of problems from various areas of computer science and artificial intelligence.

Spedizione gratuita
€ 99.01
o 3 rate da € 33.00 senza interessi con
Disponibile in 10-12 giorni
servizio Prenota Ritiri su libro Parameterized Complexity in the Polynomial Hierarchy
Prenota e ritira
Scegli il punto di consegna e ritira quando vuoi

Recensioni degli utenti

e condividi la tua opinione con gli altri utenti