Completeness and Reduction in Algebraic Complexity Theory

Name: Completeness and Reduction in Algebraic Complexity Theory
Brand: Springer Nature
SKU: 9783540667520
Availability: InStock

Completeness and Reduction in Algebraic Complexity Theory

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783540667520

Condition

New

0 Reviews

0 Questions | 0 Answers

Product 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.

Available Colors

N/A

Available Sizes

N/A

1 Offer Price Range: $84.99 - $84.99

BEST PRICE

Single Product Purchase

$84.99

@ Link.springer.com BUY Now

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com Rate Seller This functionality is for registered users only. Go to Login/Register		$84.99	$84.99			$84.99		See Site	In stock	Visit Store