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(Tf(d2)) operations in R, where Tf(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. We also present a quick test for deciding whether a given polynomial has zeros expressible by square roots and describe some additional methods for special cases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
von Oertzen, T. Exact Computation of Polynomial Zeros Expressible by Square Roots. Algorithmica 46, 119–136 (2006). https://doi.org/10.1007/s00453-006-0071-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-006-0071-2