|
Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
|
| List Price: | £83.00 |
| Price: | £70.55 & eligible for FREE Super Saver Delivery on orders over £5. Details |
Availability: Usually dispatched within 24 hours
Dispatched from and sold by Amazon.co.uk
Product Description
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.
Product Details
- Amazon Sales Rank: #2826658 in Books
- Published on: 2000-06-21
- Original language: English
- Number of items: 1
- Binding: Hardcover
- 168 pages
Editorial Reviews
Review
.,.". 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
