On bivariate Hensel and its parallelization

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On bivariate Hensel and its parallelization

Full text

Pdf (206 KB)

Source

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

Rostock, Germany

Pages: 96 - 100

Year of Publication: 1998

ISBN:1-58113-002-3

Author

Laurent Bernardin

Institute of Scientific Computing, ETH Zurich, Switzerland

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
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): 5, Downloads (12 Months): 10, Citation Count: 3

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/281508.281567 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	Laurent Bernardin, Maple on a massively parallel, distributed memory machine, Proceedings of the second international symposium on Parallel symbolic computation, p.217-222, July 20-22, 1997, Maui, Hawaii, United States [doi>10.1145/266670.266732]
	2	Laurent Bernardin , Michael B. Monagan, Efficient Multivariate Factorization over Finite Fields, Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.15-28, June 23-27, 1997
	3	Keith O. Geddes , Stephen R. Czapor , George Labahn, Algorithms for computer algebra, Kluwer Academic Publishers, Norwell, MA, 1992
	4	Erich Kaltofen, Sparse Hensel Lifting, Research Contributions from the European Conference on Computer Algebra-Volume 2, p.4-17, April 01-03, 1985
	5	Erich Kaltofen , Barry M. Trager, Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators, Journal of Symbolic Computation, v.9 n.3, p.301-320, March 1990 [doi>10.1016/S0747-7171(08)80015-6]
	6	KNUTH, D. E. Seminumerical Algorithms, vol. 2 of The Art of Computer Programming. Addison Wesley, 1981.
	7	Joris van der Hoeven, Lazy multiplication of formal power series, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.17-20, July 21-23, 1997, Kihei, Maui, Hawaii, United States [doi>10.1145/258726.258738]
	8	Guy Viry, Factorization of multivariate polynomials with coefficients in Fp, Journal of Symbolic Computation, v.15 n.4, p.371-391, April 1993 [doi>10.1006/jsco.1993.1027]
	9	Paul S. Wang, Parallel polynomial operations on SMPs: an overview, Journal of Symbolic Computation, v.21 n.4-6, p.397-410, April/May/June 1996 [doi>10.1006/jsco.1996.0021]
	10	ZIPPEL, R. E. Effective Polynomial Computation. Kluwer Academic Publishers, Boston, 1993.

CITED BY 3

	Michael B. Monagan , Allan D. Wittkopf, On the design and implementation of Brown's algorithm over the integers and number fields, Proceedings of the 2000 international symposium on Symbolic and algebraic computation, p.225-233, July 2000, St. Andrews, Scotland
	Joris Van der Hoeven, Relax, but don't be too lazy, Journal of Symbolic Computation, v.34 n.6, p.479-542, December 2002
	A. Bostan , G. Lecerf , B. Salvy , É. Schost , B. Wiebelt, Complexity issues in bivariate polynomial factorization, Proceedings of the 2004 international symposium on Symbolic and algebraic computation, p.42-49, July 04-07, 2004, Santander, Spain