Del i serien Algorithms and Computation in Mathematics

Completeness and Reduction in Algebraic Complexity Theory

Inbunden, Engelska, 2000

AvPeter Bürgisser

1 399 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

1 829 kr

Skickas inom 5-8 vardagar

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.

Produktinformation

Utgivningsdatum2000-06-21
Mått155 x 235 x undefined mm
FormatInbunden
SpråkEngelska
SerieAlgorithms and Computation in Mathematics
Antal sidor168
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540667520

Tillhör följande kategorier

"... The subject matter of the book is not easy, since it involves prerequisites from several areas, among them complexity theory, combinatorics, analytic number theory, and representations of symmetric and general linear groups. But the author goes to great lengths to motivate his results, to put them into perspective, and to explain the proofs carefully. In summary, this monograph advances its area of algebraic complexity theory, and is a must for people for working on this subject. And it is a pleasure to read." Joachim von zur Gathen, Mathematical Reviews, Issue 2001g