Completeness and Reduction in Algebraic Complexity Theory: 7 (Algorithms and Computation in Mathematics, 7) - Image 1

£61.10

Springer Completeness and Reduction in Algebraic Complexity Theory: 7 (Algorithms and Computation in Mathematics, 7)

Name: Completeness and Reduction in Algebraic Complexity Theory: 7 (Algorithms and Computation in Mathematics, 7)
Brand: Springer
Price: 61.1 GBP
Availability: InStock

7443967

Algorithms

This is the usual price. Wait for it to drop, or tell us your number.

£61 today · usual range £52–£63 · best ever £52

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 80 days • 80 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 80 days • 5 price levels

Days at Price

Current Price

Price Analysis

Most common price: £58 (28 days, 35.0%)

Price range: £52 - £63

Price levels: 5 different prices over 80 days

Description

One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing machine model and achieves a classification of discrete computational prob lems according to their algorithmic difficulty. Turing machines formalize al gorithms which operate on finite strings of symbols over a finite alphabet. By contrast, in algebraic models of computation, the basic computational step is an arithmetic operation (or comparison) of elements of a fixed field, for in stance of real numbers. Hereby one assumes exact arithmetic. In 1989, Blum, Shub, and Smale [12] combined existing algebraic models of computation with the concept of uniformity and developed a theory of NP-completeness over the reals (BSS-model). Their paper created a renewed interest in the field of algebraic complexity and initiated new research directions. The ultimate goal of the BSS-model (and its future extensions) is to unite classical dis crete complexity theory with numerical analysis and thus to provide a deeper foundation of scientific computation (cf. [11, 101]). Already ten years before the BSS-paper, Valiant [107, 110] had proposed an analogue of the theory of NP-completeness in an entirely algebraic frame work, in connection with his famous hardness result for the permanent [108]. While the part of his theory based on the Turing approach (#P-completeness) is now standard and well-known among the theoretical computer science com munity, his algebraic completeness result for the permanents received much less attention.

Product Specifications

Brand: Springer
Model: 7443967
Format: hardcover
ASIN: 3540667520
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 21 June 2000
Listed Since: 22 December 2006

Barcode

No barcode data available

Springer Completeness and Reduction in Algebraic Complexity Theory: 7 (Algorithms and Computation in Mathematics, 7)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

Algebraic Complexity Theory: 315 (Grundlehren der mathematischen Wissenschaften, 315)

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

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

The Foundations of Computability Theory

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

Turing Computability: Theory and Applications (Theory and Applications of Computability)

Art of Computer Programming, The, Volumes 1-4B, Boxed Set: Fundamental Algorithms / Seminumerical Algorithms / Sorting and Searching / Combinatorial ... Part 1 / Combinatorial Algorithms, Part 2

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

From Astrophysics to Unconventional Computation: Essays Presented to Susan Stepney on the Occasion of her 60th Birthday: 35 (Emergence, Complexity and Computation, 35)

Springer - Patterns in Permutations and Words Book

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

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

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science)

THINKING ABOUT GODEL AND TURING: ESSAYS ON COMPLEXITY, 1970-2007

Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Problems on Algorithms: A Comprehensive Exercise Book for Students in Software Engineering

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

The Incomputable: Journeys Beyond the Turing Barrier (Theory and Applications of Computability)

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

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)

New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings: 3526 (Lecture Notes in Computer Science, 3526)