Algebraische Komplexitätstheorie I: Eine Einführung
Séminaire lotharingien de combinatoire, Tome 36 (1996)
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
Algebraic complexity theory is the study of the intrinsic algorithmic difficulty of algebraic problems within an algebraic model of computation. Motivated by questions of numerical and symbolic computation, this branch of research originated in 1954 when Ostrowski inquired about the optimality of Horner's rule. We survey some of the techniques for proving lower bounds in the straight-line and computation tree model. Among these are Strassen's degree bound, which relies on the concept of the degree of an affine variety, as well as lower bounds in terms of the number of connected components (or higher Betti numbers) of semi-algebraic sets. As a particular application of these methods we discuss the optimality of the Knuth-Schönhage algorithm for computing the GCD of two univariate polynomials.
@article{SLC_1996_36_a0,
author = {Peter B\"urgisser and Michael Clausen},
title = {Algebraische {Komplexit\"atstheorie} {I:} {Eine} {Einf\"uhrung}},
journal = {S\'eminaire lotharingien de combinatoire},
publisher = {mathdoc},
volume = {36},
year = {1996},
url = {http://geodesic.mathdoc.fr/item/SLC_1996_36_a0/}
}
Peter Bürgisser; Michael Clausen. Algebraische Komplexitätstheorie I: Eine Einführung. Séminaire lotharingien de combinatoire, Tome 36 (1996). http://geodesic.mathdoc.fr/item/SLC_1996_36_a0/