Parameterized Complexity (Monographs in Computer Science) - Image 1

Price loading...

Springer Parameterized Complexity (Monographs in Computer Science)

Name: Parameterized Complexity (Monographs in Computer Science)
Brand: Springer

Algorithms

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

This monograph presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This will be suitable for graduate students and researchers in computer science and mathematics, particularly those studying complexity theory.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 1461267986
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Publication Date: 08 October 2012
Listed Since: 06 December 2012

Barcode

No barcode data available

Springer Parameterized Complexity (Monographs in Computer Science)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

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

Fundamentals of Parameterized Complexity (Texts in Computer Science)

Fundamentals of Parameterized Complexity (Texts in Computer Science)

Parameterized Algorithms

Springer Super-Recursive Algorithms - Computer Science Book

Parameterized Algorithms

Computability and Complexity Theory (Texts in Computer Science)

Algorithms in Invariant Theory (Texts & Monographs in Symbolic Computation)

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

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

Computational Complexity: A Conceptual Perspective

A Programming Approach to Computability (Monographs in Computer Science)

Descriptive Complexity (Texts in Computer Science)

A Practical Theory of Programming (Monographs in Computer Science)

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

Theory of Computation (Texts in Computer Science)

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

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

Tractability: Practical Approaches to Hard Problems

Algorithms and Complexity (Volume A) (Handbook of Theoretical Computer Science, Volume A)

Polystochastic Models for Complexity (Understanding Complex Systems)

Abstraction, Refinement and Proof for Probabilistic Systems (Monographs in Computer Science)

Mathematics for the Analysis of Algorithms: v. 1 (Progress in Theoretical Computer Science)

Complexity and Real Computation