This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
14.6 Bibliographical Notes
S. Basu, New Results on Quantifier Elimination over Real Closed Fields and Applications to Constraint Databases, Journal of the ACM, 46(4), 537–555 (1999).
S. Basu, R. Pollack, M.-F. Roy, On the Combinatorial and Algebraic Complexity of Quantifier Elimination, Journal of the ACM, 43 1002–1045, (1996).
S. Basu, R. Pollack, M.-F. Roy, Computing the Dimension of a Semi-Algebraic Set, Zap. Nauchn. Semin. POMI 316 42–54 (2004).
D. Grigor’ev, The Complexity of deciding Tarski algebra, Journal of Symbolic Computation 5 65–108 (1988).
J. Heintz, M.-F. Roy, P. Solernò, Sur la complexité du principe de Tarski-Seidenberg, Bull. Soc. Math. France 118 101–126 (1990).
J. Renegar. On the computational complexity and geometry of the first order theory of the reals, Journal of Symbolic Computation, 13: 255–352 (1992).
N. N. Vorobjov. Complexity of computing the dimension of a semi-algebraic set. J. of Symbolic Comput., 27: 565–579 (1999).
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Quantifier Elimination. In: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, vol 10. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-33099-2_15
Download citation
DOI: https://doi.org/10.1007/3-540-33099-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33098-1
Online ISBN: 978-3-540-33099-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)