Algorithms and Computation in Mathematics: Completeness and Reduction in Algebraic Complexity Theory (Hardcover)
Peter Burgisser
Springer
9783540667520
3-540-66752-0
This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's algebraic theory of NP-completeness; interrelations.
read more…
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.
| BOOKSTORE | TOTAL | ||
|---|---|---|---|
| {{condition}} | {{price}} + {{shipping}} s/h | ||
| This book is currently reported out of stock for sale, but WorldCat can help you find it in your local library: | |||