Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
Price not available for France
You can still browse on Amazon. Try another country above.
Book Details
Author(s)
Peter Bürgisser
Publisher
Springer
ISBN / ASIN
3540667520
ISBN-13
9783540667520
Marketplace
France 🇫🇷
Ratings & Reviews
No reviews yet — be the first!
No reviews yet.
Description
This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's algebraic theory of NP-completeness; interrelations with the classical theory as well as the Blum-Shub-Smale model of computation, questions of structural complexity; fast evaluation of representations of general linear groups; and complexity of immanants.
