Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy / Ronald de Haan.

Unlimited

Authorized users

Can lend chapters, not whole ebooks

Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy / Ronald de Haan.

9783662606704 (electronic book)
3662606704 (electronic book)
9783662606698

Berlin, Germany : Springer, [2019]

English

1 online resource.

QA9.P37 D44 2019

510.1

The book presents the 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. -- Provided by publisher.

Includes bibliographical references and index.

Access limited to authorized users.

Description based on online resource; title from digital title page (viewed on January 24, 2020).

Lecture notes in computer science ; 11880.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Online Resources > Ebooks
All Resources