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

Parameterized complexity

Author: R G Downey; M R Fellows
Publisher: New York : Springer, ©1999.
Series: Monographs in computer science.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:
This monograph presents an approach to complexity theory which offers a means of analyzing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language. In doing so, the reader is introduced to new classes of algorithms which may be analyzed more precisely than heretofore. The authors have made the book as self-contained as  Read more...
Rating:

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

Subjects
More like this

Find a copy in the library

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

Details

Additional Physical Format: Online version:
Downey, R.G. (Rod G.).
Parameterized complexity.
New York : Springer, ©1999
(OCoLC)607099137
Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: R G Downey; M R Fellows
ISBN: 038794883X 9780387948836
OCLC Number: 37004493
Notes: New Zealand authors.
Description: xv, 533 pages : illustrations ; 24 cm.
Contents: 1. Computers, Complexity, and Intractability from the Parametric Point of View --
I. Parameterized Tractability --
2. The Basic Definitions --
3. Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernel --
4. Optimization Problems, Approximation Schemes, and Their Relation with FPT --
5. The Advice View Revisited and LOGSPACE --
6. Methods via Automata and Bounded Treewidth --
7. Well-Quasi-Orderings and the Robertson-Seymour Theorems --
8. Miscellaneous Techniques --
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 --
18. The Monotone and Antimonotone Collapse Theorems: Monotone W[2t + 1] = W[2t] and Antimonotone W[2t + 2] = W[2t + 1] --
19. The Structure of Languages Under Parameterized Reducibilities --
A.A Problem Compendium and Guide to W-Hierarchy Completeness, Hardness, and Classification; and Some Research Horizons --
B. Research Horizons.
Series Title: Monographs in computer science.
Responsibility: R.G. Downey, M.R. Fellows.
More information:

Abstract:

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking  Read more...

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/37004493> # Parameterized complexity
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "37004493" ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
    schema:about <http://dewey.info/class/511.3/e21/> ;
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/536388#Topic/berechnungskomplexitat> ; # Berechnungskomplexität
    schema:about <http://experiment.worldcat.org/entity/work/data/536388#Topic/computabilidade_e_complexidade> ; # COMPUTABILIDADE E COMPLEXIDADE
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/74521505> ; # Michael Ralph Fellows
    schema:copyrightYear "1999" ;
    schema:creator <http://viaf.org/viaf/37997762> ; # Rod G. Downey
    schema:datePublished "1999" ;
    schema:description "This monograph presents an approach to complexity theory which offers a means of analyzing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language. In doing so, the reader is introduced to new classes of algorithms which may be analyzed more precisely than heretofore. The authors have made the book as self-contained as possible, and a lot of background material is included. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest in this book."@en ;
    schema:description "1. Computers, Complexity, and Intractability from the Parametric Point of View -- I. Parameterized Tractability -- 2. The Basic Definitions -- 3. Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernel -- 4. Optimization Problems, Approximation Schemes, and Their Relation with FPT -- 5. The Advice View Revisited and LOGSPACE -- 6. Methods via Automata and Bounded Treewidth -- 7. Well-Quasi-Orderings and the Robertson-Seymour Theorems -- 8. Miscellaneous Techniques -- 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 -- 18. The Monotone and Antimonotone Collapse Theorems: Monotone W[2t + 1] = W[2t] and Antimonotone W[2t + 2] = W[2t + 1] -- 19. The Structure of Languages Under Parameterized Reducibilities -- A.A Problem Compendium and Guide to W-Hierarchy Completeness, Hardness, and Classification; and Some Research Horizons -- B. Research Horizons."@en ;
    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:isSimilarTo <http://www.worldcat.org/oclc/607099137> ;
    schema:name "Parameterized complexity"@en ;
    schema:productID "37004493" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/37004493#PublicationEvent/new_york_springer_1999> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/536388#Agent/springer> ; # Springer
    schema:url <http://catdir.loc.gov/catdir/enhancements/fy0815/97022882-t.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/37004493> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<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/37004493> ; # Parameterized complexity
    schema:name "Monographs in computer science." ;
    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"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/536388#Topic/computabilidade_e_complexidade> # COMPUTABILIDADE E COMPLEXIDADE
    a schema:Intangible ;
    schema:name "COMPUTABILIDADE E COMPLEXIDADE"@en ;
    .

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

<http://viaf.org/viaf/37997762> # Rod G. Downey
    a schema:Person ;
    schema:familyName "Downey" ;
    schema:givenName "Rod G." ;
    schema:givenName "R. G." ;
    schema:name "Rod G. Downey" ;
    .

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

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

<http://www.worldcat.org/oclc/607099137>
    a schema:CreativeWork ;
    rdfs:label "Parameterized complexity." ;
    schema:description "Online version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/37004493> ; # Parameterized complexity
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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