Articoli correlati a Completeness and Reduction in Algebraic Complexity...

Completeness and Reduction in Algebraic Complexity Theory: 7 - Brossura

Libro 3 di 24: Algorithms and Computation in Mathematics

Bürgisser, Peter

 
9783642086045: Completeness and Reduction in Algebraic Complexity Theory: 7

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.