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

Skip to content

Parameterized Complexity Theory

Parameterized Complexity Theory

Parameterized Complexity Theory Hardback - 2006

by J. Flum

Add to wish list
  • New
  • Hardback
New

Description

Hardcover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; N/A
Ask the seller a question Add to wish list
A$222.18
A$15.60 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)

Details

  • Title Parameterized Complexity Theory
  • Author J. Flum
  • Binding Hardback
  • Edition First
  • Condition New
  • Pages 495
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2006-02-09
  • Bookseller's Inventory # ria9783540299523_inp
  • ISBN 9783540299523 / 3540299521
  • Weight 2.15 lbs (0.98 kg)
  • Dimensions 9.4 x 6.3 x 1.2 in (23.88 x 16.00 x 3.05 cm)
  • Category Computers - General Information
  • Library of Congress Catalogue Number 2005938662
  • Dewey Decimal Code 004
  • Quantity available 574

About Ria Christie Collections Greater London, United Kingdom

Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

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 Ria Christie Collections

Reader reviews for Parameterized Complexity Theory

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-