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 |
Search Result 1
