Factorisation des polynômes à plusieurs variables à coefficients entiers

 Access to full text

 Full (PDF)

1. 1. A. V. AHO, J. E. HOPCROFT and J. D. ULLMANN, The Design and Analysis of Computer Algorithms, Addison-Wesly, Reading, Massachusetts, 1974. Zbl0326.68005MR413592
2. 2. E. R. BERLEKAMP, Algebraic Coding Theory, MacGraw-Hill, New York, 1968, p. 146-150. Zbl0988.94521MR238597
3. 3. A. O. GEL'FOND, Transcendental and Algebraic Numbers, GITTL, MOSCOW, 1952, trad. anglaise, Dover, New York, 1960, p. 135 et 138. MR111736
4. 4. D. E. KNUTH, The Art of Computer Programming, vol. II : Seminumerical algorithms, Addison-Wesley, Reading, Massachusetts, 1969, p. 302. Zbl0191.18001MR378456
5. 5. R. T. MOENCK, Fast Compilation of GCD's; ACM Symposium of Computing, 30 avril-2 mai 1973, p. 142-151. Zbl0306.68027MR455528
6. 6. R. T. MOENCK, On the efficiency of algorithms for Polynomial factoring, Math. of Comp., vol. 31, n° 137, 1977, p. 235-250. Zbl0348.65045MR422193
7. 7. D. R. MUSSER, Multivariate Polynomial Factorisation, J. Ass. Comp. Mach., vol. 22, n° 2, 1975, p. 291-308. Zbl0301.65029MR396470
8. 8. P. S. WANG and L. P. ROTHSCHILD, Factoring Multivariate Polynomials over the Integers, Math. of Comp., vol. 29, n° 131, 1975, p. 935-950. Zbl0311.10052MR396471
9. 9. H. ZASSENHAUS, On Hensel factorisation, J. Number Theory, vol. 1, 1969, p. 291-311. Zbl0188.33703MR242793