Free Access
Issue
RAIRO. Inform. théor.
Volume 12, Number 4, 1978
Page(s) 305 - 318
DOI https://doi.org/10.1051/ita/1978120403051
Published online 01 February 2017
  1. 1. A. V. AHO, J. E. HOPCROFT and J. D. ULLMANN, The Design and Analysis of Computer Algorithms, Addison-Wesly, Reading, Massachusetts, 1974. [MR: 413592] [Zbl: 0326.68005]
  2. 2. E. R. BERLEKAMP, Algebraic Coding Theory, MacGraw-Hill, New York, 1968, p. 146-150. [MR: 238597] [Zbl: 0988.94521]
  3. 3. A. O. GEL'FOND, Transcendental and Algebraic Numbers, GITTL, MOSCOW, 1952, trad. anglaise, Dover, New York, 1960, p. 135 et 138. [MR: 111736]
  4. 4. D. E. KNUTH, The Art of Computer Programming, vol. II : Seminumerical algorithms, Addison-Wesley, Reading, Massachusetts, 1969, p. 302. [MR: 378456] [Zbl: 0191.18001]
  5. 5. R. T. MOENCK, Fast Compilation of GCD's; ACM Symposium of Computing, 30 avril-2 mai 1973, p. 142-151. [MR: 455528] [Zbl: 0306.68027]
  6. 6. R. T. MOENCK, On the efficiency of algorithms for Polynomial factoring, Math. of Comp., vol. 31, n° 137, 1977, p. 235-250. [MR: 422193] [Zbl: 0348.65045]
  7. 7. D. R. MUSSER, Multivariate Polynomial Factorisation, J. Ass. Comp. Mach., vol. 22, n° 2, 1975, p. 291-308. [MR: 396470] [Zbl: 0301.65029]
  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. [MR: 396471] [Zbl: 0311.10052]
  9. 9. H. ZASSENHAUS, On Hensel factorisation, J. Number Theory, vol. 1, 1969, p. 291-311. [MR: 242793] [Zbl: 0188.33703]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.