Abstract
This payer presents an algorithm for the computation of the sign of the value of a polynomial at an algebraic number.
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.
References
Brown, W.S. On Euclid’s Algorithm and the Computation of Polynomial Greatest Divisors,JACM ,18, pp.478–504 (1971).
Gantmacher, F.R.Applications of the Theory of Matrices ,Interscience, New York (1959).
Sakkalis, T. The Euclidean Algorithm and the Degree of the Gauss Map, IBM TR, RC-13303, (1987).
Seidenberg, A. A new decision method for elementary algebra,Annals of Math. 60, (1954), pp.365–374.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this paper
Cite this paper
Sakkalis, T. (1989). Signs of Algebraic Numbers. In: Kaltofen, E., Watt, S.M. (eds) Computers and Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9647-5_16
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9647-5_16
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97019-6
Online ISBN: 978-1-4613-9647-5
eBook Packages: Springer Book Archive