Multivariate Polynomial Factorization
Journal of the ACM (JACM)
On square-free decomposition algorithms
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Newton's iteration and the sparse Hensel algorithm (Extended Abstract)
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
On the complexity of factoring polynomials with integer coefficients
On the complexity of factoring polynomials with integer coefficients
Computer Algebra: Past and Future
Journal of Symbolic Computation
Complexity of factoring and calculating the GCD of linear ordinary differential operators
Journal of Symbolic Computation
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An overview of computational complexity
Communications of the ACM
Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
An overview of computational complexity
ACM Turing award lectures
Exact polynomial factorization by approximate high degree algebraic numbers
Proceedings of the 2009 conference on Symbolic numeric computation
| Hi-index | 0.02 |
Given an arbitrary but fixed integer r -&-ge; 3. We show that testing r-variate polynomials with integer coefficients for irreducibility is m-reducible in polynomial time of the total degree and the largest coefficient length to testing bivariate polynomials for irreducibility. Factoring r-variate polynomials into irreducibles is polynomial time Turing-reducible to completely factoring bivariate polynomials.