Abstract
In this paper, we give an efficient algorithm to find symbolically correct zeros of a polynomial f ∈ R[X] which can be represented by square roots. R can be any domain if a factorization algorithm over R[X] is given, including finite rings or fields, integers, rational numbers, and finite algebraic or transcendental extensions of those. Asymptotically, the algorithm needs \(O(T_{f}(d^{2}))\) operations in R, where T f (d) are the operations for the factorization algorithm over R[X] for a polynomial of degree d. Thus, the algorithm has polynomial running time for instance for polynomials over finite fields or the rationals.
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
Abel, N.H.: Beweis der Unmöglichkeit, algebraische Gleichungen von höheren Graden als dem vierten allgemein aufzulösen. Journal der reinen und angewandten Mathematik 1 (1826)
Cardano, G.: Ars Magna, 1545
Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Heidelberg (2000)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms. Springer, Heidelberg (1997)
Cox, D., Little, J., O’Shea, D.: Using Algebraic Geometry. Springer, Heidelberg (1998)
Gathen, J.v.z., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)
Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer Academic Publishers, Dordrecht (1992)
Landau, S., Miller, G.: Solvability by Radicals is in Polynomial Time. Journal of Computer and Systems Sciences 30(2), 179–208 (1985)
Lang, S.: Algebraic Number Theory. Springer, New York (1986)
Neukirch, J.: Algebraische Zahlentheorie. Springer, Berlin (1992)
Oertzen, T.v.: Das Konstruktionsproblem. Phd Thesis at the Saarland University (2003)
Reifen, H.J., Scheja, G., Vetter, U.: Algebra. Verlag Bibliographisches Institut AG (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
von Oertzen, T. (2004). Exact Computation of Polynomial Zeros Expressible by Square Roots. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)