Parallel distinct degree factorization algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel distinct degree factorization algorithm

Full text

Pdf (808 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1996 international symposium on Symbolic and algebraic computation table of contents

Zurich, Switzerland

Pages: 18 - 25

Year of Publication: 1996

ISBN:0-89791-796-0

Authors

Tetsuro Fujise	Mitsubishi Research Institute, Otemachi 2-3-6, Chiyoda-ku, Tokyo 100, Japan
Hirokazu Murao	Computer Centre, The University of Tokyo, Yayoi 2-11-16, Bunkyo-ku, Tokyo 113, Japan

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 10, Citation Count: 1

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/236869.236886 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	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	BORODIN, A., AND MUNRO, I. The Computational Complexity of Algebraic and Numeric Problems. Theory of Computation Series. American Elsevier Publishing Company, Inc., 1975.
	3	R. P. Brent , H. T. Kung, Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM (JACM), v.25 n.4, p.581-595, Oct. 1978 [doi>10.1145/322092.322099]
	4	David G. Cantor , Erich Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, v.28 n.7, p.693-701, Oct. 1991 [doi>10.1007/BF01178683]
	5	Keith O. Geddes , Stephen R. Czapor , George Labahn, Algorithms for computer algebra, Kluwer Academic Publishers, Norwell, MA, 1992
	6	Erich Kaltofen , Victor Shoup, Subquadratic-time factoring of polynomials over finite fields, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.398-406, May 29-June 01, 1995, Las Vegas, Nevada, United States [doi>10.1145/225058.225166]
	7	MURAO, H., AND FUJISE, T. Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation, in Proceedings of PASCO '9~ (Linz, Austria, Sept. 26-28 1994), H. Hong, Ed., pp. 304- 315.
	8	VON ZUR GATHEN, J., AND SHOUP, V. Computing Frobenius maps and factoring polynomials. Computational Complexity 2 (1992), 187-224.