S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Paper
Complexity of Bezout's theorem V: polynomial time
Abstract
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.
Related
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Fan Zhang, Junwei Cao, et al.
IEEE TETC
Yao Qi, Raja Das, et al.
ISSTA 2009