£50.05

Springer Complexity and Real Computation

Price data last checked 18 day(s) ago - will refresh soon

View at Amazon

We'll watch every seller, every day. One email when your price arrives.

About as cheap as it gets. The only time it was cheaper was 3 months ago.

£50 today · all-time low £50 (Apr 2026) · usually £51

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

Historical
Generating forecast…
£51.58 £49.38 £49.86 £50.34 £50.82 £51.30 £51.78 26 April 2026 14 May 2026 01 June 2026 19 June 2026 07 July 2026

Price Distribution

Price distribution over 73 days • 2 price levels

Days at Price
Current Price
7 days · current 66 days 0 17 33 50 66 £50 £51 Days at Price

Price Analysis

Most common price: £51 (66 days, 90.4%)

Price range: £50 - £51

Price levels: 2 different prices over 73 days

Description

Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The objects of study are algorithms defined within a formal model of computation. Upper bounds on the computational complexity of a problem are usually derived by constructing and analyzing specific algorithms. Meaningful lower bounds on computational complexity are harder to come by, and are not available for most problems of interest. The dominant approach in complexity theory is to consider algorithms as oper ating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot rep resent real or complex numbers, unless the numbers are rounded to approximate values from a discrete set. A major concern of the theory is the number of com putation steps required to solve a problem, as a function of the length of the input string.

Key Features

Complexity and Real Computation

Product type: ABIS BOOK

Springer

Product Specifications

Format
hardcover
Domain
Amazon UK
Release Date
30 October 1997
Listed Since
08 February 2007

Barcode

No barcode data available

Similar Products You Might Like

Limits of Computation: An Introduction to the Undecidable and the Intractable
97% match

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

CRC Press

£79.07 15 Jul 2026
Descriptive Complexity (Texts in Computer Science)
96% match

Descriptive Complexity (Texts in Computer Science)

Springer

£61.80 17 Jun 2026
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)
96% match

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)

De Gruyter

£105.50 12 Jul 2026
Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings: 11485 (Lecture Notes in Computer Science, 11485)
96% match

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

Springer

£53.10 09 Jul 2026
MIT Press Computability and Complexity - Theory of Computation
96% match

MIT Press Computability and Complexity - Theory of Computation

MIT Press

£31.88 25 Jul 2026
Computability and Complexity Theory (Texts in Computer Science)
96% match

Computability and Complexity Theory (Texts in Computer Science)

Springer

£64.56 06 Jul 2026
Parameterized and Exact Computation: 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings: 7535 (Lecture Notes in Computer Science, 7535)
95% match

Parameterized and Exact Computation: 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings: 7535 (Lecture Notes in Computer Science, 7535)

Springer

£39.02 15 Jul 2026
Demystifying Computation: A Hands-on Introduction
95% match

Demystifying Computation: A Hands-on Introduction

Scientific Publishing

£53.41 02 Jul 2026
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
95% match

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

Springer

£62.64 05 Jul 2026
Complexity, Science and Society
95% match

Complexity, Science and Society

CRC Press

£41.89 04 Jul 2026
Computational Thinking for the Modern Problem Solver (Chapman & Hall/CRC Textbooks in Computing)
95% match

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

CRC Press

£54.60 17 Jun 2026
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)
95% match

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)

Springer

£53.54 06 Jul 2026
Introduction to Computational Thinking: Problem Solving, Algorithms, Data Structures, and More
95% match

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

Apress

£49.85 23 Jun 2026
Computational Thinking: First Algorithms, Then Code (Undergraduate Topics in Computer Science)
95% match

Computational Thinking: First Algorithms, Then Code (Undergraduate Topics in Computer Science)

Springer

£43.02 29 Jun 2026
Algorithmic Adventures: From Knowledge to Magic
95% match

Algorithmic Adventures: From Knowledge to Magic

Springer

£41.02 01 Jul 2026
Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)
95% match

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

Springer

£49.12 10 Jul 2026
On the Foundations of Computing
95% match

On the Foundations of Computing

Oxford University Press

£52.88 13 Jul 2026
Fundamentals of Parameterized Complexity (Texts in Computer Science)
95% match

Fundamentals of Parameterized Complexity (Texts in Computer Science)

Springer

£89.37 15 Jul 2026
The Foundations of Computability Theory
95% match

The Foundations of Computability Theory

Springer

£50.87 30 Jun 2026
What Can Be Computed? – A Practical Guide to the Theory of Computation
95% match

What Can Be Computed? – A Practical Guide to the Theory of Computation

Princeton University Press

£39.35 19 Jun 2026
Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings: 2906 (Lecture Notes in Computer Science, 2906)
95% match

Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings: 2906 (Lecture Notes in Computer Science, 2906)

Springer

£83.20 01 Jul 2026
The Nature of Computation
95% match

The Nature of Computation

Oxford University Press

£62.00 17 Jun 2026