Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
Peter Bürgisser · 2000
Where to buy
Amazon’s price changes daily, so the most accurate place to see it is there, at the moment you buy.
View on AmazonThis is an affiliate link: if you buy through it, the site earns a small commission at no extra cost to you, which helps us bring quality content and maintain the site. As an Amazon Associate we earn from qualifying purchases.
About the book
"The theory of NP-completeness is a cornerstone of computational complexity. This monograph provides a thorough and comprehensive treatment of this concept in the framework of algebraic complexity theory. Many of the results presented are new and published for the first time. Topics include: complete treatment of 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. The book can be used at the advanced undergraduate or at the beginning graduate level in either mathematics or computer science."--BOOK JACKET.
Book details
- Year
- 2000
- Language
- English
- Publisher
- Springer
- Editions
- 1
- Pages
- 168
- ISBN
- 9783540667520
Data source: Wikidata
