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 ...
Read More
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.
Read Less
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
17986293006
Shipping Options:
Standard Shipping: $4.61
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Algorithms and Computation in Mathematics . XII, 168 p. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
17986917789
Shipping Options:
Standard Shipping: $4.61
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Algorithms and Computation in Mathematics . XII, 168 p. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
17986387700
Shipping Options:
Standard Shipping: $4.61
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Algorithms and Computation in Mathematics . XII, 168 p. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
17986618069
Shipping Options:
Standard Shipping: $4.61
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Algorithms and Computation in Mathematics . XII, 168 p. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
