A theorem on random polynomials and some consequences in average complexity

DOI10.1016/S0747-7171(08)80052-1zbMath0725.12007MaRDI QIDQ2277521

Felipe Cucker, Marie-Françoise Roy

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

real algebraic numberscodingsaverage run time

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10)

Related Items

Numerical Evidence for a Conjecture in Real Algebraic Geometry, NC algorithms for real algebraic numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• Complexity of computation on real algebraic numbers
• On the Expected Number of Real Zeros of Random Polynomials I. Coefficients with Zero Means
• On the Number of Real Roots of a Random Algebraic Equation
• On the average number of real roots of a random algebraic equation