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

Parameterized complexity theory

Author: Jörg Flum; M Grohe
Publisher: Berlin : Springer, ©2006.
Series: Texts in theoretical computer science.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Database:WorldCat
Summary:
"Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability." "This book is a state-of-the-art introduction into both algorithmic techniques  Read more...
Rating:

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

Subjects
More like this

 

Find a copy online

Find a copy in the library

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

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
Flum, Jörg.
Parameterized complexity theory.
Berlin : Springer, ©2006
(DLC) 2005938662
(OCoLC)67766562
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Jörg Flum; M Grohe
ISBN: 9783540299530 354029953X 3540299521 9783540299523 1280625740 9781280625749
OCLC Number: 262692167
Description: 1 online resource (xiii, 493 pages) : illustrations.
Contents: Fixed-Parameter Tractability --
Reductions and Parameterized Intractability --
The Class W[P] --
Logic and Complexity --
Two Fundamental Hierarchies --
The First Level of the Hierarchies --
The W-Hierarchy --
The A-Hierarchy --
Kernelization and Linear Programming Techniques --
The Automata-Theoretic Approach --
Tree Width --
Planarity and Bounded Local Tree Width --
Homomorphisms and Embeddings --
Parameterized Counting Problems --
Bounded Fixed-Parameter Tractability and Limited Nondeterminism --
Subexponential Fixed-Parameter Tractability.
Series Title: Texts in theoretical computer science.
Responsibility: J. Flum, M. Grohe.
More information:

Abstract:

Parameterized complexity theory is a branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. This book presents an introduction to  Read more...

Reviews

Editorial reviews

Publisher Synopsis

From the reviews: "The book is comprehensive and up-to-date. ! The definitions are illustrated by good examples, the proofs are complete and proceed at a convenient pace, the connections and the Read more...

 
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/262692167> # Parameterized complexity theory
    a schema:Book, schema:CreativeWork, schema:MediaObject ;
    library:oclcnum "262692167" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/51205885#Place/berlin> ; # Berlin
    schema:about <http://dewey.info/class/511.3/e22/> ;
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/51205885#Topic/algorithmes> ; # Algorithmes
    schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/51205885#Topic/complexite_de_calcul_informatique> ; # Complexité de calcul (Informatique)
    schema:about <http://experiment.worldcat.org/entity/work/data/51205885#Topic/computers_machine_theory> ; # COMPUTERS--Machine Theory
    schema:about <http://experiment.worldcat.org/entity/work/data/51205885#Topic/informatique> ; # Informatique
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/3185314> ; # Martin Grohe
    schema:copyrightYear "2006" ;
    schema:creator <http://viaf.org/viaf/54214837> ; # Jörg Flum
    schema:datePublished "2006" ;
    schema:description "Fixed-Parameter Tractability -- Reductions and Parameterized Intractability -- The Class W[P] -- Logic and Complexity -- Two Fundamental Hierarchies -- The First Level of the Hierarchies -- The W-Hierarchy -- The A-Hierarchy -- Kernelization and Linear Programming Techniques -- The Automata-Theoretic Approach -- Tree Width -- Planarity and Bounded Local Tree Width -- Homomorphisms and Embeddings -- Parameterized Counting Problems -- Bounded Fixed-Parameter Tractability and Limited Nondeterminism -- Subexponential Fixed-Parameter Tractability."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/51205885> ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/51205885#Series/texts_in_theoretical_computer_science> ; # Texts in theoretical computer science.
    schema:isSimilarTo <http://www.worldcat.org/oclc/67766562> ;
    schema:name "Parameterized complexity theory"@en ;
    schema:productID "262692167" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/262692167#PublicationEvent/berlin_springer_2006> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/51205885#Agent/springer> ; # Springer
    schema:reviews <http://www.worldcat.org/title/-/oclc/262692167#Review/465538658> ;
    schema:url <http://www.myilibrary.com?id=62574> ;
    schema:url <http://www.myilibrary.com?id=62574&ref=toc> ;
    schema:url <http://site.ebrary.com/id/10130012> ;
    schema:url <http://dx.doi.org/10.1007/3-540-29953-X> ;
    schema:url <http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=160442> ;
    schema:url <http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-29952-3> ;
    schema:url <http://rave.ohiolink.edu/ebooks/ebc/354029953X> ;
    schema:workExample <http://worldcat.org/isbn/9781280625749> ;
    schema:workExample <http://worldcat.org/isbn/9783540299523> ;
    schema:workExample <http://worldcat.org/isbn/9783540299530> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/262692167> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/51205885#Series/texts_in_theoretical_computer_science> # Texts in theoretical computer science.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/262692167> ; # Parameterized complexity theory
    schema:name "Texts in theoretical computer science." ;
    schema:name "Texts in theoretical computer science" ;
    .

<http://experiment.worldcat.org/entity/work/data/51205885#Topic/algorithmes> # Algorithmes
    a schema:Intangible ;
    schema:name "Algorithmes"@en ;
    schema:name "Algorithmes"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/51205885#Topic/complexite_de_calcul_informatique> # Complexité de calcul (Informatique)
    a schema:Intangible ;
    schema:name "Complexité de calcul (Informatique) "@en ;
    schema:name "Complexité de calcul (Informatique)"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/51205885#Topic/computers_machine_theory> # COMPUTERS--Machine Theory
    a schema:Intangible ;
    schema:name "COMPUTERS--Machine Theory"@en ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
    schema:name "Algorithms"@en ;
    .

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

<http://viaf.org/viaf/3185314> # Martin Grohe
    a schema:Person ;
    schema:familyName "Grohe" ;
    schema:givenName "Martin" ;
    schema:givenName "M." ;
    schema:name "Martin Grohe" ;
    .

<http://viaf.org/viaf/54214837> # Jörg Flum
    a schema:Person ;
    schema:familyName "Flum" ;
    schema:givenName "Jörg" ;
    schema:name "Jörg Flum" ;
    .

<http://worldcat.org/isbn/9781280625749>
    a schema:ProductModel ;
    schema:isbn "1280625740" ;
    schema:isbn "9781280625749" ;
    .

<http://worldcat.org/isbn/9783540299523>
    a schema:ProductModel ;
    schema:isbn "3540299521" ;
    schema:isbn "9783540299523" ;
    .

<http://worldcat.org/isbn/9783540299530>
    a schema:ProductModel ;
    schema:isbn "354029953X" ;
    schema:isbn "9783540299530" ;
    .

<http://www.worldcat.org/oclc/67766562>
    a schema:CreativeWork ;
    rdfs:label "Parameterized complexity theory." ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/262692167> ; # Parameterized complexity theory
    .

<http://www.worldcat.org/title/-/oclc/262692167#Review/465538658>
    a schema:Review ;
    schema:itemReviewed <http://www.worldcat.org/oclc/262692167> ; # Parameterized complexity theory
    schema:reviewBody ""Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability." "This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters each are devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic." "The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity."--Jacket." ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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