The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Journal of the ACM (JACM)
ACM '73 Proceedings of the ACM annual conference
Symbolic integration the stormy decade
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Algorithms for partial fraction decomposition and rational function integration
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Simplification of radical expressions
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
ESSAYS IN ALGEBRAIC SIMPLIFICATION
ESSAYS IN ALGEBRAIC SIMPLIFICATION
Algorithms for polynomial factorization.
Algorithms for polynomial factorization.
On computing with factored rational expressions
ACM SIGSAM Bulletin
A tutorial introduction to Maple
Journal of Symbolic Computation
The computer algebra system CAS1 for the IBM-PC
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Scratchpad's view of algebra II: A categorical view of factorization
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Computing Frobenius maps and factoring polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computation of the Jordan canonical form of a square matrix (using the Axiom programming language)
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Arithmetic and factorization of polynomial over F2 (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
A numerical absolute primality test for bivariate polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
GCD of polynomials and Bezout matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Polynomial factorization over F2
Mathematics of Computation
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Algebraic algorithms using p-adic constructions
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
The black-box Niederreiter algorithm and its implementation over the binary field
Mathematics of Computation
The approximate GCD of inexact polynomials
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
An efficient squarefree decomposition algorithm
ACM SIGSAM Bulletin
On lacunary polynomial perfect powers
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
The approximate irreducible factorization of a univariate polynomial: revisited
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Deterministic distinct-degree factorization of polynomials over finite fields
Journal of Symbolic Computation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Journal of Symbolic Computation
Detecting lacunary perfect powers and computing their roots
Journal of Symbolic Computation
Computer Aided Geometric Design
New Techniques for the Computation of Linear Recurrence Coefficients
Finite Fields and Their Applications
| Hi-index | 0.00 |
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).