BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS
Stock photo: cover may vary

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) Hardback - 2006

by Flum, J

Add to wish list
  • Used
  • Hardback
Used: Good

Description

Springer, 2006-02-09. 2006. hardcover. Used: Good. 6.30x1.20x9.40. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$177.92
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

From the publisher

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 to 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 are each 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.

tracking-