Hüppa põhisisu juurde
Raamatukoi
Tõde ja õigus

Parameterized Complexity in the Polynomial Hierarchy

Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

Ronald de Haan · Springer-Verlag Berlin and Heidelberg GmbH & Co. KG · 2019

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.

Saadavus
100,00 €

Uus kasutamata raamat

Täna tellides on tarneaeg umbes 10 päeva (27.11.2026)Tellimuse täitmise aeg on umbkaudne ja sõltub nädalapäevast, millal tellimus tehakse. Reeglina ei kulu üle kahe nädala.

Tarne ja kättesaamine

Detailid

Alapealkiri
Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
ISBN
9783662606698
Aasta
2019
Keel
inglise
Köide
Pehme kaas
Lehekülgi
398
Kaal
624 g