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

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

Out of Stock
SKU: SONG3540667520
Brand: Springer
$77.25 $110.36
Sold out Save $33.11
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

One of the most important and successful theories in computational complex ity is that of NPcompleteness. 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 NPcompleteness over the reals (BSSmodel). Their paper created a renewed interest in the field of algebraic complexity and initiated new research directions. The ultimate goal of the BSSmodel (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 BSSpaper, Valiant [107, 110] had proposed an analogue of the theory of NPcompleteness 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 (#Pcompleteness) is now standard and wellknown among the theoretical computer science com munity, his algebraic completeness result for the permanents received much less attention.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed