Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy /: extending parameterized complexity theory to higher levels of the hierarchy. ([2019])

• Record Type: Book
• Further Information: Note: Ronald de Haan.
• Authors: De Haan, Ronald
• 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.
• Publisher Details: Berlin, Germany : Springer
• Publication Date: 2019
• Extent: 1 online resource
• Subjects: 510.1; Logic, Symbolic and mathematical; Electronic books
• Languages: English
• ISBNs: 9783662606704; 3662606704
• Related ISBNs: 9783662606698
• Notes: Note: Includes bibliographical references and index.; Note: Description based on online resource; title from digital title page (viewed on January 24, 2020).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.