Abstract
The real root counting problem is one of the main computational problems in Real Algebraic Geometry. It is the following: Let \(\mathbb{D}\) be an ordered domain and \(\mathbb{B}\) a real closed field containing \(\mathbb{D}\). Find algorithms which for every P ∈ \(\mathbb{D}\) [x] compute the number of roots of P in \(\mathbb{B}\). More precisely we shall study the following problem.
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
González-Vega, L., Recio, T., Lombardi, H., Roy, MF. (1998). Sturm—Habicht Sequences, Determinants and Real Roots of Univariate Polynomials. 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-7091-9459-1_14
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82794-9
Online ISBN: 978-3-7091-9459-1
eBook Packages: Springer Book Archive