東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Parameterized complexity in the poly...

De Haan, Ronald.

FindBook

Google Book

Amazon

博客來

Parameterized complexity in the polynomial hierarchy = extending parameterized complexity theory to higher levels of the hierarchy /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Parameterized complexity in the polynomial hierarchy/ by Ronald de Haan.
其他題名:	extending parameterized complexity theory to higher levels of the hierarchy /
作者:	De Haan, Ronald.
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2019.,
面頁冊數:	xi, 398 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Logic, Symbolic and mathematical. -
電子資源:	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. - Berlin, Heidelberg :Springer Berlin Heidelberg :2019. - xi, 398 p. :ill., digital ;24 cm. - Lecture notes in computer science,118800302-9743 ;. - Lecture notes in computer science ;11880..

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:

532051
Logic, Symbolic and mathematical.

LC Class. No.: QA9.P37 / D44 2019

Dewey Class. No.: 510.1

Parameterized complexity in the polynomial hierarchy = extending parameterized complexity theory to higher levels of the hierarchy /
LDR:02674nmm a2200361 a 4500 001 2219222
003 DE-He213
005 20191230101020.0
006 m d
007 cr nn 008maaau
008 201126s2019 gw s 0 eng d
020 $a 9783662606704 $q (electronic bk.)
020 $a 9783662606698 $q (paper)
024 7 $a 10.1007/978-3-662-60670-4 $2 doi
035 $a 978-3-662-60670-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.P37 $b D44 2019
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 510.1 $2 23
090 $a QA9.P37 $b D278 2019
100 1 $a De Haan, Ronald. $3 3454296
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.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2019.
300 $a xi, 398 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11880
490 1 $a Theoretical computer science and general issues
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 Logic, Symbolic and mathematical. $3 532051
650 1 4 $a Mathematical Logic and Foundations. $3 892656
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 11880. $3 3454297
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-662-60670-4
950 $a Computer Science (Springer-11645)