Abstract
This paper concerns recent progress on the computational complexity of decision methods and quantifier elimination methods for the first order theory of the reals. The paper begins with a quick introduction of terminology followed by a short survey of some complexity highlights. We then discuss ideas leading to the most (theoretically) efficient algorithms known. The discussion is necessarily simplistic as a rigorous development of the algorithms forces one to consider a myriad of details.
Reprinted from DIMACS Series, Volume 6, 1991, pp. 287–308, by permission of the American Mathematical Society.
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.
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag/Wien
About this paper
Cite this paper
Renegar, J. (1998). Recent Progress on the Complexity of the Decision Problem for the Reals. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-7091-9459-1_11
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82794-9
Online ISBN: 978-3-7091-9459-1
eBook Packages: Springer Book Archive