skip to content
Parameterized complexity Preview this item
ClosePreview this item
Checking...

Parameterized complexity

Author: Rod G Downey; M R Fellows
Publisher: New York [u.a.] Springer 1999
Series: Monographs in computer science
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:

Presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This monograph is suitable for graduate students and researchers in computer  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Rod G Downey; M R Fellows
ISBN: 038794883X 9780387948836
OCLC Number: 845440392
Notes: Literaturverz. S. [489] - 516
Description: XV, 533 S. graph. Darst
Contents: 1 Computers, Complexity, and Intractability from the Parametric Point of View.- 1.1 Introduction.- 1.2 The Role of Computational Complexity in Modern Science.- 1.3 The Story of Dr.O, Continued.- 1.4 Reworking the Foundations of Computational Complexity.- 1.5 A Deal with the Devil.- 1.6 How Parameters Arise in Practice.- 1.7 A Distinctive Positive Toolkit.- 1.8 O No?.- 1.9 The Barometer of Parametric Intractability.- 1.10 Structural Aspects of Parameterized Complexity.- 1.11 An Overview of Current Research Horizons.- I Parameterized Tractability.- 2 The Basic Definitions.- 2.1 Fixed-Parameter Tractability.- 2.2 The Advice View.- 3 Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernel.- 3.1 The Method of Bounded Search Trees.- 3.1.1 The Basic Method.- 3.1.2 Heuristic Improvements, Shrinking the Search Tree.- 3.2 The Method of Reduction to a Problem Kernel.- 3.2.1 The Basic Method.- 3.2.2 Hereditary Properties and Leizhen Cai's Theorem.- 4 Optimization Problems, Approximation Schemes, and Their Relation with FPT.- 4.1 Optimization Problems.- 4.2 How FPT and Optimization Problems Relate.- 4.3 The Classes MAXSNP, MIN F+?1(h), and FPT.- 5 The Advice View Revisited and LOGSPACE.- 6 Methods via Automata and Bounded Treewidth.- 6.1 Classical Automata Theory.- 6.1.1 Deterministic Finite Automata.- 6.1.2 Nondeterministic Finite Automata.- 6.1.3 Regular Languages.- 6.1.4 The Myhill-Nerode Theorem and the Method of Test Sets.- 6.1.5 Classical Tree Automata.- 6.2 Treewidth.- 6.3 Bodlaender's Theorem.- 6.4 Parse Trees for Graphs of Bounded Treewidth and an Analog of the Myhill-Nerode Theorem.- 6.5 Courcelle's Theorem.- 6.5.1 The Basic Theorem.- 6.5.2 Implementing Courcelle's Theorem.- 6.6 Seese's Theorem.- 6.7 Notes on MS1 Theory.- 7 Well-Quasi-Orderings and the Robertson-Seymour Theorems.- 7.1 Basic WQO Theory.- 7.2 Thomas' Lemma.- 7.2.1 Thomas' Lemma Fails for Path Decompositions.- 7.3 The Graph Minor Theorem for Bounded Treewidth.- 7.4 Excluding a Forest.- 7.5 Connections with Automata Theory and Boundaried Graphs.- 7.6 A Sketch of the Proof of the Graph Minor Theorem.- 7.7 Immersions and the Nash-Williams Conjecture.- 7.8 Applications of the Obstruction Principle and WQO's.- 7.9 Effectivizations of Obstruction-Based Methods.- 7.9.1 Effectivization by Self-Reduction.- 7.9.2 Effectivization by Obstruction Set Computation.- 8 Miscellaneous Techniques.- 8.1 Depth-First Search.- 8.2 Bounded-Width Subgraphs, the Plehn-Voigt Theorem, and Induced Subgraphs.- 8.3 Hashing.- II Parameterized Intractability.- 9 Reductions.- 10 The Basic Class W[1] and an Analog of Cook's Theorem.- 11 Some Other W[1]-Hardness Results.- 12 The W -Hierarchy.- 13 Beyond W[t]-Hardness.- 14 Fixed Parameter Analogs of PSPACE and k-Move Games.- 15 Provable Intractability: The Class XP.- III Structural and Other Results.- 16 Another Basis for the W -Hierarchy, the Tradeoff-Theorem, and Randomized Reductions.- 17 Relationships with Classical Complexity and Limited Nondeterminism.- 17.1 Classical Complexity.- 17.2 Nondeterminism in P, LOGNP, and the Cai-Chen Model and Other Models.- 18 The Monotone and Antimonotone Collapse Theorems: MONOTONEW[2t + 1] = W[2t] and ANTIMONOTONEW[2t + 2] = W[2t + 1].- 19 The Structure of Languages Under Parameterized Reducibilities.- 19.1 Some Tools.- 19.2 Results.- IV Appendix.- A A Problem Compendium and Guide to W-Hierarchy Completeness, Hardness, and Classification; and Some Research Horizons.- B Research Horizons.- B.2 A Lineup of Tough Customers.- B.3 Connections Between Classical and Parameterized Complexity.- B.4 Classification Gaps.- B.5 Structural Issues and Analogs of Classical Results.- References.
Series Title: Monographs in computer science
Responsibility: R.G. Downey; M.R. Fellows
More information:

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/845440392> # Parameterized complexity
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "845440392" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/536388#Place/new_york_u_a> ; # New York u.a.
   schema:about <http://dewey.info/class/511.3/> ;
   schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
   schema:about <http://id.loc.gov/authorities/subjects/sh85029473> ; # Computational complexity
   schema:about <http://experiment.worldcat.org/entity/work/data/536388#Topic/berechnungskomplexitat> ; # Berechnungskomplexität
   schema:author <http://viaf.org/viaf/74521505> ; # M. R. Fellows
   schema:bookFormat bgn:PrintBook ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/536388#Person/downey_rod_g> ; # Rod G. Downey
   schema:datePublished "1999" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/536388> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/536388#Series/monographs_in_computer_science> ; # Monographs in computer science
   schema:name "Parameterized complexity" ;
   schema:productID "845440392" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/845440392#PublicationEvent/new_york_u_a_springer1999> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/536388#Agent/springer> ; # Springer
   schema:url <http://www.gbv.de/dms/bowker/toc/9780387948836.pdf> ;
   schema:url <http://catdir.loc.gov/catdir/enhancements/fy0815/97022882t.html> ;
   schema:workExample <http://worldcat.org/isbn/9780387948836> ;
   umbel:isLike <http://d-nb.info/95558549X> ;
   umbel:isLike <http://bnb.data.bl.uk/id/resource/GB9912939> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/845440392> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/536388#Person/downey_rod_g> # Rod G. Downey
    a schema:Person ;
   schema:familyName "Downey" ;
   schema:givenName "Rod G." ;
   schema:name "Rod G. Downey" ;
    .

<http://experiment.worldcat.org/entity/work/data/536388#Series/monographs_in_computer_science> # Monographs in computer science
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/845440392> ; # Parameterized complexity
   schema:name "Monographs in computer science" ;
    .

<http://experiment.worldcat.org/entity/work/data/536388#Topic/berechnungskomplexitat> # Berechnungskomplexität
    a schema:Intangible ;
   schema:name "Berechnungskomplexität" ;
    .

<http://id.loc.gov/authorities/subjects/sh85029473> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity" ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity" ;
    .

<http://viaf.org/viaf/74521505> # M. R. Fellows
    a schema:Person ;
   schema:familyName "Fellows" ;
   schema:givenName "M. R." ;
   schema:name "M. R. Fellows" ;
    .

<http://worldcat.org/isbn/9780387948836>
    a schema:ProductModel ;
   schema:isbn "038794883X" ;
   schema:isbn "9780387948836" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.