Recent Progress on the Complexity of the Decision Problem for the Reals

  • James Renegar
Conference paper
Part of the Texts and Monographs in Symbolic Computation book series (TEXTSMONOGR)


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.


Boolean Function Arithmetic Operation Free Variable Sign Vector Decision Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag/Wien 1998

Authors and Affiliations

  • James Renegar

There are no affiliations available

Personalised recommendations