Liknande böcker

Sets, Logic and Maths for Computing
Bok av David Makinson
Adaptive mesh refinement, theory and applications : proceedings of the C...
Bok av 9783540270393
Categorical Combinators, Sequential Algorithms, and Functional Programming
Bok av Pierre-Louis Curien
Algebraic Complexity Theory
Bok av Peter Burgisser
Complexity Classifications of Boolean Constraint Satisfaction Problems
Bok av Nadia Creignou
The Foundations of Computability Theory
Bok av Borut Robic
Computing and Combinatorics [electronic resource] : 6th Annual Internati...
Bok av Australia) 2000 : (6th : COCOON 2000 Sydney
Algorithms in Invariant Theory
Bok av Peter Paule

Completeness and Reduction in Algebraic Complexity Theory

Bok av Peter Burgisser
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.