On the efficiency of Newton's method in approximating all zeros of a system of complex polynomials

Solving systems of nonlinear polynomial equations faster

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation

The implicit function theorem revisited

IBM Journal of Research and Development

Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra

Electronic Notes in Theoretical Computer Science (ENTCS)

Computational complexity of kernel-based density-ratio estimation: a condition number analysis

Machine Learning