Leo Liberti, James Ostrowski
Journal of Global Optimization
We show that there are algorithms which find an approximate zero of a system of polynomial equations and which function in polynomial time on the average. The number of arithmetic operations is cN4s, where N is the input size and c a universal constant. © 1994.
Leo Liberti, James Ostrowski
Journal of Global Optimization
Hendrik F. Hamann
InterPACK 2013
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Pradip Bose
VTS 1998