On the Efficiency of a Polynomial Irreducibility Test

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the Efficiency of a Polynomial Irreducibility Test

Full text

Pdf (685 KB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 2 (April 1978) table of contents

Pages: 271 - 282

Year of Publication: 1978

ISSN:0004-5411

Author

David R. Musser

Information Sciences Institute, University of Southern California, 4676 Admiralty Way, Marina del Rey, CA and University of Wisconsin-Madison, Madison, Wisconsin

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

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/322063.322071 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 R Algebraic Coding Theory. McGraw-Hall, New York, 1968
	2	BERLEKAMP, E R. Factonng polynomials over large fimte fields Math. Comput. 24, 111 (July 1970), 713-735.
	3	George E. Collins, The SAC-1 system: An introduction and survey, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.144-152, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806279]
	4	COLLINS, G E Computer algebra of polynomials and rat,anal funcuons Amer. Math Monthly 80, 7 (Aug.-Sept 1973), 725-755
	5	COLLINS, G E., HEINDEL, L E., HOROWITZ, E, MCCLELLAN, M T, AND MUSSER, D.R The SAC-I modular arlthmeUc system. Tech Rep. No 10, U of Wtsconsm--Mad,son, Madison, W,s, June 1969
	6	COLLINS, (~ E, AND MUSSI~R, D.R. The SAC-I polynomial factorizatton system. Comptr. Set. Tech Rep. No 157, UntversRy of Wisconsin--Madison, Madison, Wls., March 1972
	7	Richard Durstenfeld, Algorithm 235: Random permutation, Communications of the ACM, v.7 n.7, p.420, July 1964 [doi>10.1145/364520.364540]
	8	HIeeARD, W Private communication, 1974
	9	KEMENY, J D, ANt) SNELL, J L Fmrte Markov Chains Van Nostrand, Pnnceton, N J, 1960
	10	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	11	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	12	David Rea Musser, Algorithms for polynomial factorization., 1971
	13	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]
	14	RIORDAN, J An Introduction to Combinatorial Analysts Wdey, New York, 1958

CITED BY 2

	P. S. Wang, Parallel univariate polynomial factorization on shared-memory multiprocessors, Proceedings of the international symposium on Symbolic and algebraic computation, p.145-151, August 20-24, 1990, Tokyo, Japan
	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