An algorithm for computing the Weierstrass normal form

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An algorithm for computing the Weierstrass normal form

Full text

Pdf (659 KB)

Source

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

Montreal, Quebec, Canada

Pages: 90 - 95

Year of Publication: 1995

ISBN:0-89791-699-9

Author

Mark van Hoeij

Department of mathematics, University of Nijmegen, 6525 ED Nijmegen, The Netherlands

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): 5, Downloads (12 Months): 31, 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/220346.220358 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	D. Le Brigand, J.J. Risler, Algorithme de Brill-Noether et codes de Goppa, Bull. Soc. math. France, 116 231-253 (1988)
	2	D. G. Cantor, Computing in the Jacobian of an Hyperelliptic Curve, Math. of Comp. Vol. 48, No. 177, 95-101 (1987)
	3	Laurent Bertrand, On the implementation of a new algorithm for the computation of hyperelliptic integrals, Proceedings of the international symposium on Symbolic and algebraic computation, p.211-215, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190419]
	4	Henri Cohen, A course in computational algebraic number theory, Springer-Verlag New York, Inc., New York, NY, 1995
	5	Duval, D., (1989). Rational Puiseux expansions, Compos. Math. 70, No. 2, 119-154
	6	G. Hach~, D. Le Brigand Effective Construction o} Algebraic Geometry Codes Rapport de recherche INRIA, No 2267 (1994)
	7	R. Hartshorne, Algebraic Geometry Springer-Verlag (~977)
	8	Mark van Hoeij, An algorithm for computing an integral basis in an algebraic function field, Journal of Symbolic Computation, v.18 n.4, p.353-363, Oct. 1994 [doi>10.1006/jsco.1994.1051]
	9	Mark van Hoeij, Computing parameterizations of rational algebraic curves, Proceedings of the international symposium on Symbolic and algebraic computation, p.187-190, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190415]
	10	J.R. Sendra, F. Winkler, Determining Simple Points on Rational Algebraic Curves, RISC-Linz Report Series No. 93-23 (1993)
	11	J. Rafael Sendra , Franz Winkler, Symbolic parametrization of curves, Journal of Symbolic Computation, v.12 n.6, p.607-631, Dec. 1991 [doi>10.1016/S0747-7171(08)80144-7]

CITED BY 2

	F. Hess, Computing Riemann---Roch spaces in algebraic function fields and related topics, Journal of Symbolic Computation, v.33 n.4, p.425-445, April 2002
	R. J. Stroeker , N. Tzanakis, Computing all integer solutions of a genus 1 equation, Mathematics of Computation, v.72 n.244, p.1917-1933, October 2003