A word in response to the corona virus crisis: Your print orders will be fulfilled, even in these challenging times. If you don’t want to wait – have a look at our ebook offers and start reading immediately.

Algorithms and Computation in Mathematics

Completeness and Reduction in Algebraic Complexity Theory

Authors: Bürgisser, Peter

Free Preview

Buy this book

eBook 96,29 €
price for Spain (gross)
  • ISBN 978-3-662-04179-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 124,79 €
price for Spain (gross)
  • ISBN 978-3-540-66752-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 124,79 €
price for Spain (gross)
  • ISBN 978-3-642-08604-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this book

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.

Reviews

".... 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 its area of algebraic complexity theory, and is a must for people for working on this subject. And it is a pleasure to read."

Joachim von zur Gathen, Mathematical Reviews, Issue 2001g

 


Table of contents (8 chapters)

Table of contents (8 chapters)

Buy this book

eBook 96,29 €
price for Spain (gross)
  • ISBN 978-3-662-04179-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 124,79 €
price for Spain (gross)
  • ISBN 978-3-540-66752-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 124,79 €
price for Spain (gross)
  • ISBN 978-3-642-08604-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Completeness and Reduction in Algebraic Complexity Theory
Authors
Series Title
Algorithms and Computation in Mathematics
Series Volume
7
Copyright
2000
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-662-04179-6
DOI
10.1007/978-3-662-04179-6
Hardcover ISBN
978-3-540-66752-0
Softcover ISBN
978-3-642-08604-5
Series ISSN
1431-1550
Edition Number
1
Number of Pages
XII, 168
Topics