Item description for Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics) by Peter Bürgisser...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.53" Width: 6.41" Height: 0.8" Weight: 1.05 lbs.
Release Date Jul 26, 2000
ISBN 3540667520 ISBN13 9783540667520
Availability 70 units. Availability accurate as of Jan 22, 2017 11:47.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.