by PeterBürgisser (Author)
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;
Format: Illustrated
Pages: 186
Edition: 2000
Publisher: Springer
Published: 21 Jun 2000
ISBN 10: 3540667520
ISBN 13: 9783540667520