Abstract
Since Tarski (1951) gave the first quantifier elimination algorithm for real closed fields, various improvements and new methods have been devised and analyzed (Arnon 1981, 1988b; Ben-Or et al. 1986; Böge 1980; Buchberger and Hong 1991; Canny 1988; Cohen 1969; Collins 1975; Collins and Hong 1991; Fitchas et al. 1990a; Grigor’ev 1988; Grigor’ev and Vorobjov 1988; Heintz et al. 1989a; Holthusen 1974; Hong 1989, 1990a, 1990b, 1991a, 1991b, 1991c; Johnson 1991; Langemyr 1990; Lazard 1990; McCallum 1984; Renegar 1992a, 1992b, 1992c; Seidenberg 1954).
Reprinted with permission from Proceedings of the International Symposium on Symbolic & Algebraic Computation, edited by P. S. Wang, ACM Press, 1992, pp. 177–188. Copyright 1992, Association for Computing Machinery, Inc.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag/Wien
About this paper
Cite this paper
Hong, H. (1998). Simple Solution Formula Construction in Cylindrical Algebraic Decomposition Based Quantifier Elimination. In: Caviness, B.F., Johnson, J.R. (eds) Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9459-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-7091-9459-1_10
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82794-9
Online ISBN: 978-3-7091-9459-1
eBook Packages: Springer Book Archive