Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy (1st ed. 2019) (Lecture Notes in Computer Science #11880)

By:

Sign Up Now! Already a Member? Log In
You must be logged into Bookshare to access this title. Learn about membership options, or view our freely available titles.

Synopsis
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.
Copyright:
2019

Book Details

Book Quality:
Publisher Quality
ISBN-13:
9783662606704
Related ISBNs:
9783662606698
Publisher:
Springer Berlin Heidelberg
Date of Addition:
Copyrighted By:
Springer
Adult content:
No
Language:
English
Has Image Descriptions:
No
Categories:
Nonfiction, Mathematics and Statistics, Philosophy
Submitted By:
Bookshare Staff
Usage Restrictions:
This is a copyrighted book.

Reviews

No Rating Yet