Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
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
Robert C. Durbeck
IEEE TACON
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Reena Elangovan, Shubham Jain, et al.
ACM TODAES