Stock image for illustration purposes only - book cover, edition or condition may vary.
Completeness and Reduction in Algebraic Complexity Theory
Peter Burgisser
€ 125.90
FREE Delivery in Ireland
Description for Completeness and Reduction in Algebraic Complexity Theory
Hardcover. Burgisser, a top expert on algebraic complexity theory, has written a monograph on current research in this field. This book gives new results in the theory of NP-completeness. It is written for mathematicians and computer scientists on both research and graduate level. Series: Algorithms and Computation in Mathematics. Num Pages: 168 pages, biography. BIC Classification: PBCD; PBW; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 244 x 165 x 12. Weight in Grams: 432.
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 ... 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 ... Read more
Product Details
Format
Hardback
Publication date
2000
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
186
Condition
New
Number of Pages
168
Place of Publication
Berlin, Germany
ISBN
9783540667520
SKU
V9783540667520
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Completeness and Reduction in Algebraic Complexity Theory
".... The subject matter of the book is not easy, since it involves prerequisites from several areas, among them complexity theory, combinatorics, analytic number theory, and representations of symmetric and general linear groups. But the author goes to great lengths to motivate his results, to put them into perspective, and to explain the proofs carefully. In summary, this monograph advances ... Read more