An Algorithm for Finding a Minimal Weierstrass Equation for an Elliptic Curve
- 1 January 1982
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 38 (157) , 257-260
- https://doi.org/10.2307/2007483
Abstract
Let E be an elliptic curve defined over an algebraic number field K and assume that some Weierstrass equation for E over K is given. Then an algorithm is described which yields a global minimal Weierstrass equation for E over K provided such a global minimal Weierstrass equation does exist.Keywords
This publication has 1 reference indexed in Scilit:
- The arithmetic of elliptic curvesInventiones Mathematicae, 1974