Parameterized Complexity in the Polynomial Hierarchy Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy /

• Κύριος συγγραφέας: de Haan, Ronald (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: Theoretical Computer Science and General Issues ; 11880
• Θέματα: Mathematical logic.; Mathematical Logic and Foundations.; Mathematical Logic and Formal Languages.

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 th...

Πίνακας περιεχομένων:

• 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.