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.; Grohe, M

Add to wish list
  • New
  • Hardback
New

Description

Springer, 2006-02-09. Hardcover. New. In shrink wrap. Looks like an interesting title!
Ask the seller a question Add to wish list
A$220.85
A$8.70 Delivery within USA
Standard delivery: 2 to 21 days
More delivery options
Ships from GridFreed LLC (California, United States)
The BIBLIO Guarantee

Details

About GridFreed LLC California, United States

Biblio member since 2021

We sell primarily non-fiction, many new books, some collectible first editions and signed books. We operate 100% online and have been in business since 2005.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from GridFreed LLC

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

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

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.

Please wait a moment while we load the requested page.

tracking-