Completeness and Reduction in Algebraic Complexity Theory: 7 - Rilegato

Burgisser, Peter

Rilegato

ISBN 10: 3540667520 ISBN 13: 9783540667520

Casa editrice: Springer Nature, 2000

Riassunto

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.

Su questo libro

Recensione

".... 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

 

Contenuti

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.

Dettagli dell'edizione

• Editore: Springer Nature
• Data di pubblicazione: 2000
• Lingua: Inglese
• ISBN 10: 3540667520
• ISBN 13: 9783540667520
• Rilegatura: Copertina rigida
• Numero di pagine: 168
• Contatto del produttore: non disponibile
• Persona responsabile: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Tiergartenstr. 17; Heidelberg; 69121; Germania