Check nearby libraries
Buy this 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.
Check nearby libraries
Buy this book
Previews available in: English
Showing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
Completeness and Reduction in Algebraic Complexity Theory
2000, Springer Berlin Heidelberg
electronic resource /
in English
3642086047 9783642086045
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Table of Contents
Edition Notes
Online full text is restricted to subscribers.
Also available in print.
Mode of access: World Wide Web.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?December 29, 2021 | Edited by ImportBot | import existing book |
June 29, 2019 | Created by MARC Bot | import new book |