Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
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
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975