Conference paper
On square-free decomposition algorithms
Abstract
In this paper, we will give three different (including revamped versions of Horowitz's and Musser's) algorithms for computing the SQFR decomposition of polynomials in R[x]. Some algorithm analysis will be carried out to show the (asymptotic) superiority of the algorithm we propose (last of the three).
Related
Conference paper
A pattern compiler
Conference paper
Algebraic algorithms using p-adic constructions
Conference paper