Central Library

Parameterized Complexity in the Polynomial Hierarchy (Record no. 86425)

000 -LEADER
fixed length control field 03479nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-662-60670-4
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730165616.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 191230s2019 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783662606704
-- 978-3-662-60670-4
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-662-60670-4
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA8.9-10.3
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBCD
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBC
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT018000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBCD
Source thema
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBC
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.3
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name de Haan, Ronald.
Relator term author.
Relationship aut
-- http://id.loc.gov/vocabulary/relators/aut
9 (RLIN) 89796
245 10 - TITLE STATEMENT
Title Parameterized Complexity in the Polynomial Hierarchy
Medium [electronic resource] :
Remainder of title Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy /
Statement of responsibility, etc. by Ronald de Haan.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2019.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2019.
300 ## - PHYSICAL DESCRIPTION
Extent XI, 398 p. 1349 illus.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 11880
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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 ## - SUMMARY, ETC.
Summary, etc. 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematical logic.
9 (RLIN) 2258
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Machine theory.
9 (RLIN) 89797
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematical Logic and Foundations.
9 (RLIN) 34712
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Formal Languages and Automata Theory.
9 (RLIN) 89798
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 89799
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783662606698
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783662606711
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 11880
9 (RLIN) 89800
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-662-60670-4">https://doi.org/10.1007/978-3-662-60670-4</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.