1 option
Parameterized Complexity in the Polynomial Hierarchy : Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy / by Ronald de Haan.
SpringerLink Books Computer Science (2011-2024) Available online
SpringerLink Books Computer Science (2011-2024)- Format:
- Book
- Author/Creator:
- de Haan, Ronald., Author.
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 11880
- Theoretical Computer Science and General Issues, 2512-2029 ; 11880
- Language:
- English
- Subjects (All):
- Logic, Symbolic and mathematical.
- Machine theory.
- Mathematical Logic and Foundations.
- Formal Languages and Automata Theory.
- Local Subjects:
- Mathematical Logic and Foundations.
- Formal Languages and Automata Theory.
- Physical Description:
- 1 online resource (XI, 398 pages) : 1349 illustrations
- Edition:
- 1st ed. 2019.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2019.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- Complexity Theory and Non-determinism
- Parameterized Complexity Theory
- Fpt-Reducibility to SAT
- The Need for a New Completeness Theory
- A New Completeness Theory
- Fpt-algorithms with Access to a SAT Oracle
- Problems in Knowledge Representation and Reasoning
- Model Checking for Temporal Logics
- Problems Related to Propositional Satisfiability
- Problems in Judgment Aggregation
- Planning Problems
- Graph Problems
- Relation to Other Topics in Complexity Theory
- Subexponential-Time Reductions
- Non-Uniform Parameterized Complexity
- Open Problems and Future Research Directions
- Conclusion
- Compendium of Parameterized Problems
- Generalization to Higher Levels of the Polynomial Hierarchy.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-662-60670-4
- 9783662606704
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.