×

An improved multivariate polynomial factoring algorithm. (English) Zbl 0388.10035


MSC:

11C08 Polynomials in number theory
11-04 Software, source code, etc. for problems pertaining to number theory
12E05 Polynomials in general fields (irreducibility, etc.)
11T06 Polynomials over finite fields
12-04 Software, source code, etc. for problems pertaining to field theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] E. R. Berlekamp, Factoring polynomials over large finite fields, Math. Comp. 24 (1970), 713 – 735. · Zbl 0247.12014
[2] E. R. Berlekamp, Factoring polynomials over finite fields, Bell System Tech. J. 46 (1967), 1853 – 1859. · Zbl 0166.04901 · doi:10.1002/j.1538-7305.1967.tb03174.x
[3] B. G. CLAYBROOK, ”Factorization of multivariate polynomials over the integers,” SIGSAM Bulletin, Feb. 1976, p. 13. · Zbl 0333.68067
[4] J. H. GRIESMER, D. R. JENKS & D. Y. Y. YUN, SCRATCHPAD User’s Manual, IBM Research Report, RA 70, June 1975.
[5] Donald E. Knuth, The art of computer programming. Vol. 2: Seminumerical algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont, 1969. · Zbl 0191.18001
[6] Serge Lang, Diophantine geometry, Interscience Tracts in Pure and Applied Mathematics, No. 11, Interscience Publishers (a division of John Wiley & Sons), New York-London, 1962. · Zbl 0115.38701
[7] MACSYMA Reference Manual, The MATHLAB Group, Project MAC, M.I.T., Cambridge, Mass., Nov. 1975.
[8] M. Mignotte, An inequality about factors of polynomials, Math. Comp. 28 (1974), 1153 – 1157. · Zbl 0299.12101
[9] Robert T. Moenck, On the efficiency of algorithms for polynomial factoring, Math. Comp. 31 (1977), no. 137, 235 – 250. · Zbl 0348.65045
[10] J. MOSES & D. Y. Y. YUN, ”The EZ-GCD algorithm,” Proceedings of ACM Annual Conference, August 1973.
[11] David R. Musser, Multivariate polynomial factorization, J. Assoc. Comput. Mach. 22 (1975), 291 – 308. , https://doi.org/10.1145/321879.321890 Paul S. Wang and Linda Preiss Rothschild, Factoring multivariate polynomials over the integers, Math. Comput. 29 (1975), 935 – 950. · Zbl 0301.65029
[12] Paul S. Wang, Factoring multivariate polynomials over algebraic number fields, Math. Comp. 30 (1976), no. 134, 324 – 336. , https://doi.org/10.1090/S0025-5718-1976-0568283-X Paul S. Wang, An improved multivariate polynomial factoring algorithm, Math. Comp. 32 (1978), no. 144, 1215 – 1231. · Zbl 0333.12003
[13] David R. Musser, Multivariate polynomial factorization, J. Assoc. Comput. Mach. 22 (1975), 291 – 308. , https://doi.org/10.1145/321879.321890 Paul S. Wang and Linda Preiss Rothschild, Factoring multivariate polynomials over the integers, Math. Comput. 29 (1975), 935 – 950. · Zbl 0301.65029
[14] P. S. WANG, ”Preserving sparseness in multivariate polynomial factorization,” Proceedings, MACSYMA User’s Conference, University of California at Berkeley, July 27-29, 1977.
[15] D. Y. Y. YUN, The Hensel Lemma in Algebraic Manipulation, Ph. D. Thesis, Department of Mathematics, M.I.T., Nov. 1973 (also Project MAC TR-138, Nov. 1974).
[16] Hans Zassenhaus, On Hensel factorization. I, J. Number Theory 1 (1969), 291 – 311. · Zbl 0188.33703 · doi:10.1016/0022-314X(69)90047-X
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.