Completeness and Reduction in Algebraic Complexity Theory /
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...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2000.
|
| Series: | Algorithms and computation in mathematics ;
7. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | 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. |
|---|---|
| Item Description: | Electronic resource. |
| Physical Description: | 1 online resource (xii, 168 pages) |
| ISBN: | 9783662041796 (electronic bk.) 3662041790 (electronic bk.) |
| ISSN: | 1431-1550 ; |