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 α.
