Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics): 7

by PeterBürgisser (Author)

• New

  Illustrated
  2000

  $165.14

  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;