Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy (2019)Paperback - 2019, 31 December 2019

Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy (2019)
Qty
1
Turbo
Ships in 2 - 3 days
In Stock
Free Delivery
Cash on Delivery
15 Days
Free Returns
Secure Checkout

Description

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.

Product Details

Book Edition:
2019
Book Format:
Paperback
Country of Origin:
NL
Date Published:
31 December 2019
Dimensions:
23.39 x 15.6 x 2.13 cm
ISBN-10:
3662606690
ISBN-13:
9783662606698
Language:
English
Location:
Berlin, Heidelberg
Pages:
398
Publisher:
Weight:
576.06 gm