Parallel univariate p-adic lifting on shared-memory multiprocessors

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel univariate p-adic lifting on shared-memory multiprocessors

Full text

Pdf (878 KB)

Source

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

Berkeley, California, United States

Pages: 168 - 176

Year of Publication: 1992

ISBN:0-89791-489-9

Author

Paul S. Wang

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): 0, Downloads (12 Months): 2, Citation Count: 1

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/143242.143304 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	Bernard Beauzamy , Vilmar Trevisan , Paul S. Wang, Polynomial factorization: sharp bounds, efficient algorithms, Journal of Symbolic Computation, v.15 n.4, p.393-413, April 1993 [doi>10.1006/jsco.1993.1028]
	2	S. C. Johnson , R. L. Graham, Problem #7, ACM SIGSAM Bulletin, v.8 n.1, p.4-4, February 1974 [doi>10.1145/1086823.1086825]
	3	E. Kaltofen, "Factorization of Polynoll~ials," Computer Algebra-Symbolic and Algebraic Computation, Computing, Suppl. 4, Springer-Verlag, 1982, pp. 95-113.
	4	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	5	Robert T. Moenck, Practical fast polynomial multiplication, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.136-148, August 10-12, 1976, Yorktown Heights, New York, United States [doi>10.1145/800205.806332]
	6	P. M. A. Moore , A. C. Norman, Implementing a polynomial factorization and GCD package, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.109-116, August 05-07, 1981, Snowbird, Utah, United States [doi>10.1145/800206.806379]
	7	Joel Moses , David Y. Y. Yun, The EZ GCD algorithm, Proceedings of the annual conference, p.159-166, August 27-29, 1973, Atlanta, Georgia, United States [doi>10.1145/800192.805698]
	8	B. Serpette, j. Vuillemiu, and J. C. Iterv~, "'BigNum" A Fort.able and EflScient Package tot Arbitrary-Precision Arithmetic," Digital Equipmerit ('orp., Paris Research Laboratory, 85, Av. Victor Hugo. 92563 Rueil-Malmaison Cedex, France.
	9	N. Sharma and P. S. Wang, "A Guide to Parallel Programming on the Sequent Balance," Technical Report, Institute for Mathematical Computation, Department of Mathematics and Computer Science, Kent State University, 1989.
	10	P. S. Wang and B. M. Trager, "New Algorithms for Polynomial Square-free Decomposition over the integers," SIAM J. Computing, Vol. 8, No. 3, Aug. 1979, pp. 300-305.
	11	P. S. Wang, "Parallel p-adic Constructions in the Univariate Polynomial Factoring Algorithm," Proceedings, MACSYMA Users' Conference 1979, Cambridge, MA, MIT pp. 310-318.
	12	Paul S. Wang, Early detection of true factors in univariate polynominal factorization, Proceedings of the European Computer Algebra Conference on Computer Algebra, p.225-235, March 28-30, 1983
	13	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 [doi>10.1145/96877.96915]
	14	H. Zassenhaus, "On Hensel Factoriza.tion." J. Number Theory 1 (1969)pp. 291-311.