Factoring Polynomials Over Algebraic Number Fields

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Factoring Polynomials Over Algebraic Number Fields

Full text

Pdf (902 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 , Issue 4 (December 1976) table of contents

Pages: 335 - 350

Year of Publication: 1976

ISSN:0098-3500

Authors

P. J. Weinberger	Bell Laboratories, Murray Hill, NJ
L. P. Rothschild	Columbia University, New York, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 35, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355705.355709 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BERLEKAMP, E. Factoring polynomials over large finite fields. Math. Computation P$ (1970), 713-735.
	2	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	3	David R. Musser, Multivariate Polynomial Factorization, Journal of the ACM (JACM), v.22 n.2, p.291-308, April 1975 [doi>10.1145/321879.321890]
	4	NARKIEWICZ, W. Elementary and Analytic Theory of Algebraic Numbers. Panstwowe Wydawnictwo Naukowe, Warsaw, Poland, 1974.
	5	ZASS~.NHAUS, H. On Hensel factomzation, Part I. J. Number Theory 1 (1969), 291-311.
	6	ZASSEN~AUS, It., AND LIANG, J. On a problem of Hasse. Math. Computation 25 (1969), 515- 519.
	7	ZIMMER, H. Computatzonal Problems, Methods, and Results in Algebraic Number Theory. Lecture Notes in Mathematics No. 262, Springer-Verlag, New York, 1972.

CITED BY 6

	A. K. Lenstra, Lattices and factorization of polynomials, ACM SIGSAM Bulletin, v.15 n.3, p.15-16, August 1981
	John Abbott, Recovery of algebraic numbers from their p-adic approximations, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.112-120, July 17-19, 1989, Portland, Oregon, United States
	James H. Davenport , Barry M. Trager, Factorization over finitely generated fields, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.200-205, August 05-07, 1981, Snowbird, Utah, United States
	Mark J. Encarnación, Factoring polynomials over algebraic number fields via norms, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.265-270, July 21-23, 1997, Kihei, Maui, Hawaii, United States
	J. A. Abbott , R. J. Bradford , J. H. Davenport, The Bath algebraic number package, Proceedings of the fifth ACM symposium on Symbolic and algebraic computation, p.250-253, July 21-23, 1986, Waterloo, Ontario, Canada
	Mark J. Encarnación, On a modular algorithm for computing GCDs of polynomials over algebraic number fields, Proceedings of the international symposium on Symbolic and algebraic computation, p.58-65, July 20-22, 1994, Oxford, United Kingdom