Completeness and Reduction in Algebraic Complexity Theory
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch (Gebunden)
106.99 €
Produktdetails
Produktinformationen zu „Completeness and Reduction in Algebraic Complexity Theory “
Klappentext zu „Completeness and Reduction in Algebraic Complexity Theory “
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.
Inhaltsverzeichnis zu „Completeness and Reduction in Algebraic Complexity Theory “
1 Introduction.- 2 Valiant's Algebraic Model of NP-Completeness.- 3 Some Complete Families of Polynomials.- 4 Cook's versus Valiant's Hypothesis.- 5 The Structure of Valiant's Complexity Classes.- 6 Fast Evaluation of Representations of General Linear Groups.- 7 The Complexity of Immanants.- 8 Separation Results and Future Directions.- References.- List of Notation.
Autoren-Porträt von Peter Bürgisser
Bürgisser, a top expert on algebraic complexity theory, has written a monograph on current research in this field. This book gives new results in the theory of NP-completeness. It is written for mathematicians and computer scientists on both research and graduate level.
Bibliographische Angaben
- Autor: Peter Bürgisser
- 2000, 168 Seiten, 16 Schwarz-Weiß-Abbildungen, Maße: 16,5 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer
- ISBN-10: 3540667520
- ISBN-13: 9783540667520
- Erscheinungsdatum: 21.06.2000
Sprache:
Englisch
Rezension zu „Completeness and Reduction in Algebraic Complexity Theory “
".... 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
Kommentar zu "Completeness and Reduction in Algebraic Complexity Theory"
0 Gebrauchte Artikel zu „Completeness and Reduction in Algebraic Complexity Theory“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Completeness and Reduction in Algebraic Complexity Theory".
Kommentar verfassen