Computational Complexity: A Modern Approach - Image 1

£52.14

Cambridge University Press Computational Complexity: A Modern Approach

Name: Computational Complexity: A Modern Approach
Brand: Cambridge University Press
Price: 52.14 GBP
Availability: InStock

Computer Science

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

£52 today · previous high £52 · all-time low £49

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 47 days · 47 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 47 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £52 (34 days, 72.3%)

Price range: £50 - £52

Price levels: 2 different prices over 47 days

Description

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 0521424267
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 20 April 2009
Listed Since: 11 August 2008

Barcode

No barcode data available

Cambridge University Press Computational Complexity: A Modern Approach

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

Demystifying Computation: A Hands-on Introduction

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

Computational Complexity: A Conceptual Perspective: 0

Theory of Computation (Texts in Computer Science)

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

The Nature of Computation

Complexity and Real Computation

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

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

Introduction to Computational Thinking: Problem Solving, Algorithms, Data Structures, and More

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

MIT Press Computability and Complexity - Theory of Computation

Computational Thinking for the Modern Problem Solver (Chapman & Hall/CRC Textbooks in Computing)

Fundamental Concepts In Computer Science: 3 (Advances in Computer Science and Engineering: Texts)

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)

Computational Thinking: First Algorithms, Then Code

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

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

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

Current Trends in Theoretical Computer Science: Entering the 21st Century

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

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

The Foundations of Computability Theory

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