On square-free decomposition algorithms
David Y. Y. Yun · ACM Symposium on Symbolic and Algebraic Computation (SYMSAC) · 1976
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).
Cited by 87 works. doi:10.1145/800205.806320 Open-access PDF
Authors
References
- The Art of Computer Programming
- The Art of Computer Programming
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- The Hensel lemma in algebraic manipulation
- Symbolic Integration
- The Problem of Integration in Finite Terms
- Algorithms for polynomial factorization.
- Symbolic integration
- Factoring multivariate polynomials over the integers
- The EZ GCD algorithm