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 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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
