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
ISSAC 1998
Conference paper
Complexity of computing semi-algebraic descriptions of the connected components of a semi-algebraic set
Abstract
This work illustrates how to efficiently compute a semi-algebraic description of the semi-algebraically connected components of a semi-algebraic set S. In view of this, an algorithm is given that outputs a semi-algebraic description for each of the semi-algebraically connected components S. This algorithm is bounded by the complexity sk+1dO(k(3)).