A theorem on random polynomials and some consequences in average complexity

Authors:
F. Cucker;M. -F. Roy
Affiliations:
Department L.S.I., Facultat d'Informàtica, Barcelona 08028, Spain LR.MA.R., Université de Rennes I, Rennes 35042, France;Department L.S.I., Facultat d'Informàtica, Barcelona 08028, Spain LR.MA.R., Université de Rennes I, Rennes 35042, France
Venue:
Journal of Symbolic Computation
Year:
1990

Citing 2
Cited 0

Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets

Journal of Symbolic Computation
Complexity of computation on real algebraic numbers

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real polynomials have very often very few real roots, and when algorithms depend on the number of real roots of polynomials rather than on their degrees, this fact has consequences on average complexity of algorithms. In this paper we recall some classical results on the average number of real roots (which is in O(log n) where n is the degree of the polynomial for many natural random distributions) and use them to get estimates on the average complexity of various algorithms characterizing real algebraic numbers.