123 citations · 479 across the 28 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.CC2007★ 36 cited
A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy
Felipe Cucker, Teresa Krick, Gregorio Malajovich +1
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of po…
math.NA2007★ 12 cited
On the number of minima of a random polynomial
Jean-Pierre Dedieu, Gregorio Malajovich
We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle…