Factoring sparse multivariate polynomials
Journal of Computer and System Sciences
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM (JACM)
Journal of Symbolic Computation - Special issue on computational algebraic complexity
A polynomial time algorithm for diophantine equations in one variable
Journal of Symbolic Computation
Polynomial Factorization 1987-1991
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Factoring bivariate sparse (lacunary) polynomials
Journal of Complexity
ACM Communications in Computer Algebra
On lacunary polynomial perfect powers
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
The number of roots of a lacunary bivariate polynomial on a line
Journal of Symbolic Computation
Optimization and NP_R-completeness of certain fewnomials
Proceedings of the 2009 conference on Symbolic numeric computation
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Optimizing n-variate (n+k)-nomials for small k
Theoretical Computer Science
Supersparse black box rational function interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Detecting lacunary perfect powers and computing their roots
Journal of Symbolic Computation
Factoring bivariate lacunary polynomials without heights
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
We present algorithms that compute all irreducible factors of degree ≤ d of supersparse (lacunary) multivariate polynomials in n variables over an algebraic number field in deterministic polynomial-time in (l+d)n, where l is the size of the input polynomial. In supersparse polynomials, the term degrees enter logarithmically as their numbers of binary digits into the size measure l. The factors are again represented as supersparse polynomials. If the factors are represented as straight-line programs or black box polynomials, we can achieve randomized polynomial-time in (l+d)O(1). Our approach follows that by H. W. Lenstra, Jr., on computing factors of univariate supersparse polynomials over algebraic number fields. We generalize our ISSAC 2005 results for computing linear factors of supersparse bivariate polynomials over the rational numbers by appealing to recent lower bounds on the height of algebraic numbers and to a special case of the former Lang conjecture.