Completeness and Reduction in Algebraic Complexity Theory
Peter Bürgisser · 2000
Where to buy
Check today’s price on Amazon. We do not show prices because they change daily.
View on AmazonAffiliate link. 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 details
- Year
- 2000
- Language
- English
- Series
- Algorithms and Computation in Mathematics -- 7
- Publisher
- Springer Berlin Heidelberg
- Editions
- 1
- Pages
- 168
- ISBN
- 9783642086045
Data source: Wikidata
More by Peter Bürgisser
