國立虎尾科技大學 |

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

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Parameterized Complexity in the Polynomial Hierarchy/ by Ronald de Haan.
Reminder of title:	Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy /
Author:	de Haan, Ronald.
Description:	XI, 398 p. 1349 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Mathematical logic. -
Online resource:	https://doi.org/10.1007/978-3-662-60670-4
ISBN:	9783662606704

Parameterized Complexity in the Polynomial Hierarchy = Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy /
de Haan, Ronald.

Parameterized Complexity in the Polynomial HierarchyExtending Parameterized Complexity Theory to Higher Levels of the Hierarchy /[electronic resource] :by Ronald de Haan. - 1st ed. 2019. - XI, 398 p. 1349 illus.online resource. - Theoretical Computer Science and General Issues ;11880. - Theoretical Computer Science and General Issues ;9163.

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.

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.

ISBN: 9783662606704

Standard No.: 10.1007/978-3-662-60670-4doiSubjects--Topical Terms:

810627
Mathematical logic.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 511.3

Parameterized Complexity in the Polynomial Hierarchy = Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy /
LDR:02950nam a22004215i 4500 001 1006842
003 DE-He213
005 20200705065154.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783662606704 $9 978-3-662-60670-4
024 7 $a 10.1007/978-3-662-60670-4 $2 doi
035 $a 978-3-662-60670-4
050 4 $a QA8.9-10.3
072 7 $a PBC $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a PBC $2 thema
072 7 $a PBCD $2 thema
082 0 4 $a 511.3 $2 23
100 1 $a de Haan, Ronald. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1300492
245 1 0 $a Parameterized Complexity in the Polynomial Hierarchy $h [electronic resource] : $b Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy / $c by Ronald de Haan.
250 $a 1st ed. 2019.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2019.
300 $a XI, 398 p. 1349 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11880
505 0 $a 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.
520 $a 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.
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Mathematical Logic and Foundations. $3 669393
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662606698
776 0 8 $i Printed edition: $z 9783662606711
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-662-60670-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)