Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J. Hopcroft, J.D. Ullman. The design and analysis of computer algorithms. Addison-Wesley (Reading (Mass), 1974)
E.R. Berlekamp. Factoring polynomials over Large finite fields. Math. Comp. 24 (1970), p. 713–735.
A.B. Borodin, I. Munroe. The computational Complexity of algebraic and numeric problems. American Elsevier (New-York, 1975).
J. Calmet, R. Loos. An improvement of Rabin's probabilistic algorithm for generating irreductible polynomials over GF(p). Information Processing Letters, 11, no 2 (1980), p. 94–95.
P. Camion. Un algorithme de construction des idempotents primitifs des idéaux d'algèbres sur \(\mathbb{F}_q\). A paraître dans "Theory and practice of combinatorics (North Holland).
P. Camion. Un algorithme de construction des idempotents primitifs des idéaux d'algèbres sur \(\mathbb{F}_q\). C.R. Acad. Sc. Paris 291 (1980), p. 479–482.
D.G. Cantor, H. Zassenhaus. On algorithms for factoring polynomials over finite fields. Preprint (Mai 1980).
Flajolet, Steyeardt. A branching process arising in dinamic hashing, trie searching and polynomial factorization. Submitted to 9-th ICALP Symp. Aarhus (1982).
M. Mignotte. An inequality about factors of polynomials. Math. Comp. 28 (1974), p. 1153–1157.
A. Miola, D.Y.Y. Yun. Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms. Eurosam's 74 — Sigsam Bull. 8 (1974), Issue no 31, p. 46–54.
R.T. Moenck. On the efficiency of algorithms for polynomial factoring. Math. Comp. 31 (1977), p. 235–250.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lazard, D. (1982). On polynomial factorization. In: Calmet, J. (eds) Computer Algebra. EUROCAM 1982. Lecture Notes in Computer Science, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11607-9_15
Download citation
DOI: https://doi.org/10.1007/3-540-11607-9_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11607-3
Online ISBN: 978-3-540-39433-4
eBook Packages: Springer Book Archive