About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Complexity
Paper
On the distance to the zero set of a homogeneous polynomial
Abstract
In this paper we prove simple estimates relating the value of a complex homogeneous polynomial at a point to the distance of the point to the zero set of the polynomial, and also the distance to the zero set along a projective line to the distance in projective space. Our motivation for doing this was to give a quantitative aspect to the algorithm of W. Zulehner and to relate it to the algorithms of J. Renegar, J. Canny, and M. Kim. © 1989.