Parameterized complexity theory

By:

Jörg Flum

Contributor(s):

M Grohe

Material type: Text

9783642067570

Subject(s):

DDC classification:

003.3 FLU

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.

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 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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 5 )
Title notes ( 2 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Status	Barcode
Books	IIITDM Kurnool General Stacks	Non-fiction	003.3 FLU (Browse shelf(Opens below))	Available	0004663
Books	IIITDM Kurnool General Stacks	Non-fiction	003.3 FLU (Browse shelf(Opens below))	Available	0004664
Books	IIITDM Kurnool General Stacks	Non-fiction	003.3 FLU (Browse shelf(Opens below))	Available	0004665
Books	IIITDM Kurnool General Stacks	Non-fiction	003.3 FLU (Browse shelf(Opens below))	Available	0004666
Reference	IIITDM Kurnool Reference	Reference	003.3 FLU (Browse shelf(Opens below))	Not For Loan (Restricted Access)	0004667

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.

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

There are no comments on this title.

to post a comment.