Algorithmica

, Volume 28, Issue 1, pp 2–15 | Cite as

Denesting by Bounded Degree Radicals

  • J. Blömer
Article

Abstract.

Given a nested radical α involving only d th roots, we show how to compute an optimal or near optimal depth denesting of α by a nested radical that involves only D th roots, where D is an arbitrary multiple of d . As a special case the algorithm can be used to compute denestings as in [9]. The running times of the algorithms are polynomial in the description size of the splitting field for α.

Key words. Denesting, Galois theory, Nested radicals, Radical simplification, Solvability by radicals. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2000

Authors and Affiliations

  • J. Blömer
    • 1
  1. 1.Department of Mathematics and Computer Science, University of Paderborn, D-33095 Paderborn, Germany. bloemer@uni-paderborn.de. Work done while at Institut für Theoretische Informatik, ETH Zürich, Switzerland.DE

Personalised recommendations