Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
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
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007