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

£63.34

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

Name: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Brand: Springer
Price: 58.94 GBP
Availability: InStock

Algorithms

Price History & Forecast

Last 35 days • 35 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 35 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £63 (31 days, 88.6%)

Price range: £59 - £63

Price levels: 2 different prices over 35 days

Description

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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3642067573
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 12 February 2010
Listed Since: 20 September 2010

Barcode

No barcode data available

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Fundamentals of Parameterized Complexity (Texts in Computer Science)

Fundamentals of Parameterized Complexity (Texts in Computer Science)

Parameterized Algorithms

Parameterized Algorithms

Parameterized Complexity (Monographs in Computer Science)

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

Computational Complexity: A Conceptual Perspective

Introduction to the Theory of Complexity (Prentice Hall International Series in Computer Science)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

The Foundations of Computability Theory

Theory of Computation (Texts in Computer Science)

Computability Theory: An Introduction to Recursion Theory

Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Complexity and Real Computation

Computational Complexity: A Modern Approach

A Programming Approach to Computability (Monographs in Computer Science)

Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets (Monographs in Computer Science)

Time-Dependent Scheduling (Monographs in Theoretical Computer Science. An EATCS Series)

Tractability: Practical Approaches to Hard Problems

Springer Super-Recursive Algorithms - Computer Science Book

Language Computability and Formal Language Theory