ParhainHinta.fi
Completeness and Reduction in Algebraic Complexity Theory

Springer

Completeness and Reduction in Algebraic Complexity Theory

Lowest observed price

€110.00
1 store

Prices at stores

1 offer
Finlandia Kirja
Observed
€110.00
Visit store

Prices are the most recently observed prices. Check the current price, availability and delivery costs at the store.

Price history

5 price observations

The chart shows the lowest recorded product price on each observation day. Prices between observations have not been verified.

Hinta nyt €110.00. Alin havaittu €109.99, korkein €110.00. (0 % keskiarvosta)

Lowest observed
€109.99
Highest observed
€110.00
Latest history observation
Price history: 2 observation days€109.99€110.0021/09/2026: €109.9929/10/2026: €110.0021/09/202629/10/2026
Show all 5 price observations
Price observed (Finnish time)Price
€109.99
€110.00
€109.99
€110.00
€110.00

Product details

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.

Brand
Springer
EAN / GTIN
9783540667520