Fast parallel absolute irreducibility testing
Journal of Symbolic Computation
Algorithms for computer algebra
Algorithms for computer algebra
Effective Noether irreducibility forms and applications
Selected papers of the 23rd annual ACM symposium on Theory of computing
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Newton Symmetric Functions and the Arithmetic of Algebraically Closed Fields
AAECC-5 Proceedings of the 5th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Polynomial Factorization 1987-1991
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Modern Computer Algebra
Complexity issues in bivariate polynomial factorization
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Absolute polynomial factorization in two variables and the knapsack problem
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Numerical factorization of multivariate complex polynomials
Theoretical Computer Science - Algebraic and numerical algorithm
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
Lifting and recombination techniques for absolute factorization
Journal of Complexity
Fast LLL-type lattice reduction
Information and Computation
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
Let f(X,Y)@?Z[X,Y] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely, of f modulo some prime integer p. The same idea of choosing a p satisfying some prescribed properties together with LLL is used to provide a new strategy for absolute factorization of f(X,Y). We present our approach in the bivariate case but the techniques extend to the multivariate case. Maple computations show that it is efficient and promising as we are able to construct the algebraic extension containing one absolute factor of a polynomial of degree up to 400.