We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£76.42
Springer Completeness and Reduction in Algebraic Complexity Theory: 7 (Algorithms and Computation in Mathematics, 7)
Price data last checked 29 day(s) ago - will refresh soon
We'll watch every seller, every day. One email when your price arrives.
This is the most expensive it has ever been. Walk away.
£76 today · previous high £76 · all-time low £73
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 62 days · 62 data points (no recent data)
Price Distribution
Price distribution over 62 days • 2 price levels
Price Analysis
Most common price: £73 (61 days, 98.4%)
Price range: £73 - £76
Price levels: 2 different prices over 62 days
Description
Product Specifications
- Brand
- Springer
- Format
- paperback
- ASIN
- 3642086047
- Domain
- Amazon UK
- Release Date
- 04 December 2010
- Listed Since
- 20 September 2010
Barcode
No barcode data available
Similar Products You Might Like
Combinatorial Set Theory of C*-Algebras (Springer Monographs in Mathematics)
Springer
Boolean Constructions in Universal Algebras: 242 (Mathematics and Its Applications, 242)
Springer
Integral Closure: Rees Algebras, Multiplicities, Algorithms (Springer Monographs in Mathematics)
Springer
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
Complex Networks VII: Proceedings of the 7th Workshop on Complex Networks CompleNet 2016: 644 (Studies in Computational Intelligence, 644)
Springer
Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences, 24)
Springer
Incomplete Information: Structure, Inference, Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
Symbolic Asymptotics: 12 (Algorithms and Computation in Mathematics, 12)
Springer
Recent Developments in Complex Analysis and Computer Algebra: This conference was supported by the National Science Foundation through Grant ... Analysis, Applications and Computation, 4)
Springer
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications: 145 (Studies in Computational Intelligence, 145)
Springer
Models and Algorithms of Time-Dependent Scheduling (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
Homogenization Algebras and Applications: A Deterministic Homogenization Theory (Springer Monographs in Mathematics)
Springer
Restarting Automata: Extensions and Generalizations (Theory and Applications of Computability)
Springer
Automata, Universality, Computation: Tribute to Maurice Margenstern: 12 (Emergence, Complexity and Computation, 12)
Springer
Algebraic, Number Theoretic, and Topological Aspects of Ring Theory
Springer
Open Problems in Mathematics and Computational Science
Springer
Resolution of Singularities of Embedded Algebraic Surfaces (Springer Monographs in Mathematics)
Springer
Approximate Commutative Algebra (Texts & Monographs in Symbolic Computation)
Springer
The Combinatory Systems Theory: A Powerful Theory for Understanding, Modeling and Simulating Collective Phenomena (Progress in IS)
Springer
Restarting Automata: Extensions and Generalizations (Theory and Applications of Computability)
Springer
Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions (Texts & Monographs in Symbolic Computation)
Springer
Models and Algorithms of Time-Dependent Scheduling (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
Algebra VI: Combinatorial and Asymptotic Methods of Algebra. Non-Associative Structures: 57 (Encyclopaedia of Mathematical Sciences, 57)
Springer
Restarting Automata: The Standard Type of Restarting Automaton and Its Variants (Theory and Applications of Computability)
Springer