Factoring multivariate polynomials over algebraic number fields
SIAM Journal on Computing
Effective Noether irreducibility forms and applications
Selected papers of the 23rd annual ACM symposium on Theory of computing
A polynomial time algorithm for diophantine equations in one variable
Journal of Symbolic Computation
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
Factoring Polynomials over Algebraic Number Fields
SIAM Journal on Computing
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
A lifting and recombination algorithm for rational factorization of sparse polynomials
Journal of Complexity
Optimizing n-variate (n+k)-nomials for small k
Theoretical Computer Science
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.00 |
We present a deterministic algorithm for computing all irreducible factors of degree =