Bibliography
- BM97
-
Laurent Bernardin and Michael B. Monagan.
Efficient Multivariate Factorization Over Finite Fields.
In Proceedings of AAECC, volume 1255 of LNCS, pages 15--28. Springer-Verlag, 1997.
- CGG89
-
Bruce W. Char, Keith O. Geddes, and Gaston H. Gonnet.
GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation.
J. Symbolic Comp., 7(1):31--48, 1989.
- Coh93
-
Henri Cohen.
A Course in Computational Algebraic Number Theory, volume 138 of Graduate Texts in Mathematics.
Springer, Berlin--Heidelberg--New York, 1993.
- GCL92
-
Keith O. Geddes, Stephen R. Czapor, and George Labahn.
Algorithms for Computer Algebra.
Kluwer, Boston/Dordrecht/London, 1992.
- MY73
-
J. Moses and D.Y.Y. Yun.
The EZ GCD algorithm.
Proc. ACM Annual Conference, 73(2):159--166, 1973.
- Tra76
-
Barry M. Trager.
Algebraic factoring and rational function integration.
In R.D. Jenks, editor, Proc. SYMSAC '76, pages 196--208. ACM press, 1976.
- vH02
-
Mark van Hoeij.
Factoring Polynomials and the knapsack problem.
J. Number Th., 95(2):167--189, 2002.
http://www.math.fsu.edu/~hoeij/paper/knapsack.ps.
- Wan78
-
Paul S. Wang.
An improved multivariate polynomial factoring algorithm.
Math. Comp., 32(144):1215--1231, 1978.
- Wan80
-
Paul S. Wang.
The EEZ-GCD algorithm.
SIGSAM Bulletin, 14(2):50--60, 1980.
V2.28, 13 July 2023