C. Bertone
- G. Chéze. Absolute polynomial factorization in several variables and the knapsack problem. In Proceedings of ISSAC 2004: 87--94, 2004. Google Scholar
Digital Library
- G. Chéze. Des méthodes symboliques-numériques et exactes pour la factorisation absolue des polynomes en deux variables. PhD thesis, Univ. Nice, France, 2004.Google Scholar
- R. Dvornicich, C. Traverso, Newton symmetric functions and the arithmetic of algebraically closed fields. Applied algebra, algebraic algorithms and error-correcting codes (Menorca, 1987), Lecture Notes in Comput. Sci., 356: 216--224, 1989. Google ScholarDigital Library
- E. Kaltofen. Fast parallel absolute irreducibility testing. J. Symbolic Comput., 1(1): 57--67, 1985. Google ScholarDigital Library
- B. Trager. On the integration of algebraic functions. PhD Thesis, 1985.Google Scholar
Index Terms
- Probabilistic algorithms for polynomial absolute factorization
Index terms have been assigned to the content through auto-classification.
Recommendations
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebraic integers over Z and is certified. It relies on a study of the ...
Modular Las Vegas algorithms for polynomial absolute factorization
Let f(X,Y) ZX,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 ...
Comments