We can't find the internet
Attempting to reconnect
Something went wrong!
Hang in there while we get back on track
£34.80
Cambridge University Press P, Np, and Np-Completeness: The Basics of Computational Complexity
Price data checked 5 days ago
We'll watch every seller, every day. One email when your price arrives.
Same price for 4 weeks. Today is much like next week.
£35 for 31 days straight · last change was May 2026
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
when this has been cheap or pricey
where the price is heading next
all-time high & low, recent range
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 86 days • 86 data points (No recent data available)
Price Distribution
Price distribution over 86 days • 3 price levels
Price Analysis
Most common price: £35 (82 days, 95.3%)
Price range: £32 - £38
Price levels: 3 different prices over 86 days
Description
Product Specifications
- Format
- paperback
- ASIN
- 0521122546
- Domain
- Amazon UK
- Release Date
- 21 October 2010
- Listed Since
- 24 December 2009
Barcode
No barcode data available
Similar Products You Might Like
The P=NP Question and Gödel’s Lost Letter
Springer
Open Problems in Mathematics and Computational Science
Springer
Logical Foundations of Proof Complexity (Perspectives in Logic)
Cambridge University Press
Theory of Semi-Feasible Algorithms (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
Algorithmic Graph Theory
Cambridge University Press
The Foundations of Computability Theory
Springer
Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)
Cambridge University Press
Simplicity is Complex: Foundations of Cyber-Physical System Design
Springer
Completeness and Reduction in Algebraic Complexity Theory: 7 (Algorithms and Computation in Mathematics, 7)
Springer
Computational Semantics with Functional Programming
Cambridge University Press
New Computational Paradigms: Changing Conceptions of What is Computable
Springer
The Mathematics of Logic: A Guide to Completeness Theorems and their Applications
Cambridge University Press
Principles of Parallel Scientific Computing: A First Guide to Numerical Concepts and Programming Methods (Undergraduate Topics in Computer Science)
Springer
Computational Models of Conditioning
Cambridge University Press
Computation, Proof, Machine: Mathematics Enters a New Age
Cambridge University Press
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
Complexity in Information Theory
Springer
Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences, 24)
Springer
Computational Complexity and Feasibility of Data Processing and Interval Computations: 10 (Applied Optimization, 10)
Springer
Competitive Equilibrium: Theory and Applications
Cambridge University Press
Computational and Mathematical Modeling in the Social Sciences
Cambridge University Press
Programming with Higher-Order Logic
Cambridge University Press
Computational Excursions in Analysis and Number Theory (CMS Books in Mathematics)
Springer
Quantum Computation and Quantum Communication:: Theory and Experiments
Springer