Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
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
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Oliver Bodemer
IBM J. Res. Dev
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM