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

£65.71

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

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

Information Systems

This is the most expensive it has ever been. Walk away.

£66 today · previous high £66 · all-time low £65

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 49 days · 49 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 49 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £65 (48 days, 98.0%)

Price range: £65 - £66

Price levels: 2 different prices over 49 days

Description

The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory. The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields. This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3540674195
Category: Books > Subjects > Computing & Internet > Computer Science > Information Systems
Domain: Amazon UK
Release Date: 01 December 2001
Listed Since: 15 January 2007

Barcode

No barcode data available

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

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

Computational Complexity: A Conceptual Perspective: 0

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

Computational Complexity: A Modern Approach

Complexity and Real Computation

Complexity Theory Retrospective II (Springer Series in Statistics)

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000: 4 (De Gruyter Series in Logic & its Applications, 4)

Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings: 11485 (Lecture Notes in Computer Science, 11485)

Limits of Computation: An Introduction to the Undecidable and the Intractable

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

The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)

Computability and Complexity Theory (Texts in Computer Science)

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

Theory of Computation (Texts in Computer Science)

Communication Complexity (for Algorithm Designers) (Foundations and Trends (R) in Theoretical Computer Science)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Complexity: Hierarchical Structures: Hierarchical Structures and Scaling in Physics: 6 (Cambridge Nonlinear Science Series, Series Number 6)

Descriptive Complexity (Texts in Computer Science)

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Computer Science – Theory and Applications: 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, ... (Lecture Notes in Computer Science, 10846)

Complexity, Science and Society

Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)