We can't find the internet
Attempting to reconnect
Something went wrong!
Hang in there while we get back on track
£94.99
Wiley Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)
illustrations
Price data last checked 156 day(s) ago - refreshing...
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 11 months ago.
£95 today · all-time low £91 (Jul 2025) · usually the usual
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 575 days • 575 data points (No recent data available)
Price Distribution
Price distribution over 575 days • 8 price levels
Price Analysis
Most common price: £101 (274 days, 47.7%)
Price range: £91 - £112
Price levels: 8 different prices over 575 days
Description
Product Specifications
- Brand
- Wiley
- Model
- illustrations
- Format
- hardcover
- ASIN
- 1118306082
- Domain
- Amazon UK
- Release Date
- 11 July 2014
- Listed Since
- 19 May 2012
Barcode
No barcode data available
Similar Products You Might Like
The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)
Springer
Limits of Computation: An Introduction to the Undecidable and the Intractable
CRC Press
Theory of Computation (Texts in Computer Science)
Springer
What Can Be Computed? – A Practical Guide to the Theory of Computation
Princeton University Press
Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)
The Foundations of Computability Theory
Springer
Complexity and Real Computation
Springer
Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)
Springer
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Springer
A Programmer's Companion to Algorithm Analysis
CRC Press
Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)
Birkhauser
Computability and Complexity
MIT Press
Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)
The Nature of Computation
A Programmer's Companion to Algorithm Analysis
CRC Press
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
Demystifying Computation: A Hands-on Introduction
Scientific Publishing
Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)
Birkhauser
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
Theory and Applications of Models of Computation: 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings: 4484 (Lecture Notes in Computer Science, 4484)
Springer
Algebraic Complexity Theory: 315 (Grundlehren der mathematischen Wissenschaften, 315)
Springer
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
Springer
Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)
Chapman and Hall/CRC
Parameterized and Exact Computation: 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings: 7535 (Lecture Notes in Computer Science, 7535)
Springer