Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
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
Conference paper
A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB