Abstract
An algorithm which recovers a rational number from its image modulo a suitable prime or prime power is used in the p-adic lifting stage of univariate polynomial factorization to detect the formation of true factors. Such detections are usually made long before the modulus reaches the coefficient bound. The early removal of factors results in a reduced lifting problem and a lower coefficient bound. Algorithms are specified. Actual computer timing data are included.
Work reported herein has been supported in part by the National Science Foundation under Grant MCS 82-01239 and in part by the Department of Energy under Grant DE-AS02-ER7602075-A010.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
E. R. Berlekamp, "Factoring Polynomials over Finite Fields," Bell System Tech. J., V. 46, 1967, pp. 1853–1859.
J. H. Griesmer, R. D. Jenks and D. Y. Yun, "SCRATCHPAD User's Manual," IBM Research ReportRA70, June 1975.
A. C. Hearn, REDUCE II a system for Algebraic Computation, The University of Utah, Computer Sciences Department, 1979.
E. Kaltofen, "On the Complexity of Factoring Polynomials with integer Coefficients," Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, New York, December 1982.
A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring Polynomials with Rational Coefficients," Report 82-05, Amsterdam Mathematisch Instituut, Universiteit van Amsterdam, 1982.
M. Mignotte, "An Inequality about Factors of Polynomials," Mathematics of Computation, Vol. 28, 1974, pp. 1153–1157.
M. Mignotte, "Some Inequalities About Univariate Polynomials," Proceedings of the 1981 ACM symposium on Symbolic and Algebraic Computation, Snowbird, Utah, August 5–7, 1981, pp. 195–199.
P. M. A. Moore and A. C. Norman, "Implementing a polynomial factorization and GCD package," Proceedings, ACM Symposium on Symbolic and Algebraic Computation, August 1981, pp. 109–113.
R. Pavelle, M. Rothstein and J. Fitch, "Computer Algebra," Scientific American, Vol 245 No. 6, December 1981, pp. 136–152.
P. S. Wang, "Parallel p-adic Constructions in the Univariate Polynomial Factoring Algorithm," Proceedings, MACSYMA Users' Conference (1979), Cambridge, MA, MIT pp. 310–318.
P. S. Wang, M. Guy, and J. Davenport, "p-adic Reconstruction of Rational Numbers," ACM SIGSAM Bulletin, Vol. 16, May 1982, pp. 2–3.
P. S. Wang, "A p-adic Algorithm for Univariate Partial Fractions," Proceedings of the 1981 ACM symposium on Symbolic and Algebraic Computation, Snowbird, Utah, August 5–7, 1981, pp. 212–217.
MACSYMA Reference Manual version nine, the MATHLAB group, Laboratory for Computer Science, MIT, Camb. MA. 02139
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Wang, P.S. (1983). Early detection of true factors in univariate polynomial factorization. In: van Hulzen, J.A. (eds) Computer Algebra. EUROCAL 1983. Lecture Notes in Computer Science, vol 162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12868-9_106
Download citation
DOI: https://doi.org/10.1007/3-540-12868-9_106
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12868-7
Online ISBN: 978-3-540-38756-5
eBook Packages: Springer Book Archive