Abstract
Let a semialgebraic set be given by a quantifier-free formula of the first-order theory of real closed fields withk atomic subformulae of the typef i≥0 for 1≤i≤k, where the polynomialsf i∈ℤ[X 1,...,X n] have degrees deg(f i)<d and the absolute value of each (integer) coefficient off i is at most 2M. An algorithm is exhibited which counts the number of connected components of the semialgebraic set in time (M (kd)n 20)O (1). Moreover, the algorithm allows us to determine whether any pair of points from the set are situated in the same connected component.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Ben-Or, D. Kozen andJ. Reif, The complexity of elementary algebra and geometry.J. Comput. System Sci. 32 (1986), 251–264.
J. Canny,The Complexity of Robot Motion Planning. MIT Press, Cambridge, 1988.
J. Canny, D. Yu. Grigorév, and N. N. Vorobjov, Jr., Finding connected components of a semialgebraic set in subexponential time. Submitted toAppl. Alg. in Eng. Comm. Comput., 1991.
A. L. Christov and D. Yu. Grigor'ev,Subexponential-time solving systems of algebraic equations, I, II. Preprints LOMI E-9-83 & E-10-83, Leningrad, 1983.
G. E. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decomposition.Springer Lec. Notes Comp. Sci. 33 (1975), 134–183.
A. Dold,Lectures on Algebraic Topology. Springer-Verlag, Berlin, 1972.
N. Fitchas, A. Galligo, and J. Morgenstern,Algorithmes rapides en séquentiel et en parallèle pour l'élimination de quantificateurs en géométrie élémentaire. UER de Mathématiques Université de Paris VII, 1988.
D. Yu. Grigor'ev, Computational complexity in polynomial algebra.Proc. International Congress of Mathematicians, Berkelev, 1986, 1452–1460.
D. Yu. Grigor'ev, Complexity of deciding Tarski algebra.J. Symb. Comp. 5 (1988), 65–108.
D. Yu. Grigor'ev, J. Heintz, M.-F. Roy, P. Solernó, andN. N. Vorobjov, Jr., Comptage des composantes connexes d'un ensemble semi-algebrique en temps simplement exponential.C. R. Acad. des. Sci. Paris, Ser. I311 (1990), 879–882.
D. Yu. Grigor'ev andN. N. Vorobjov, Jr., Solving systems of polynomial Inequalities in subexponential time.J. Symb. Comp. 5 (1988), 37–64.
J. Heintz, Definability and fast quantifier elimination in algebraically closed field.Theor. Comp. Sci. 24 (1983), 239–278.
J. Heintz, M.-F. Roy, andP. Solernó,Construction de chemins dans un ensemble semi-algébrique. Preprint, Univ. Buenos Aires, Argentina, 1990a.
J. Heintz, M.-F. Roy, and P. Solernó, Single exponential path finding in semialgebraic sets.Proc. AAECC Conf., Tokyo, 1990b.
J. Heintz, M.-F. Roy, andP. Solernó, Sur la complexité du principe de Tarski-Seidenberg.Bull. Soc. Math. France,118 (1990c), 101–126.
M. W. Hirsch,Differential Topology. Springer-Verlag, Berlin, 1976.
S. Lang,Algebra. Addison-Wesley, New York, 1965.
J. Renegar,On the computational complexity and geometry of the first-order theory of reals, Parts I–III. Technical Report, Cornell University, 1989.
I. R. Shafarevich,Basic Algebraic Geometry. Springer-Verlag, Berlin, 1974.
A. Tarski,A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.
N. N. Vorobjov, Jr., Deciding consistency of systems of inequalities being polynomial in exponential functions in subexponential times.Notes of Sci. Seminars of Leningrad Department of Math. Steklov Inst. 176 (1989), 3–52 (in Russian).
N. N. Vorobjov, Jr. andD. Yu. Grigor'ev, Determination of the number of connected components of a semialgebraic set in subexponential time.Soviet Math. Dokl. 42 (1991), 563–566.
H. R. Wüthrich, Ein Entscheidungsverfahren für die Theorie der reell-abgeschlossenen Körper.Springer Lec. Notes Comp. Sci 43 (1976), 138–162.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Grigor'ev, D.Y., Vorobjov, N.N. Counting connected components of a semialgebraic set in subexponential time. Comput Complexity 2, 133–186 (1992). https://doi.org/10.1007/BF01202001
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01202001