An Algorithm for Finding a Minimal Weierstrass Equation for an Elliptic Curve

DOI10.2307/2007483zbMath0493.14016OpenAlexW4235125690MaRDI QIDQ3955500

Michael Laska

Publication date: 1982

Full work available at URL: https://doi.org/10.2307/2007483

zbMATH Keywords

elliptic curvecomputer algorithmminimal Weierstrass equation

Mathematics Subject Classification ID

Special algebraic curves and curves of low genus (14H45) Elliptic curves (14H52) Software, source code, etc. for problems pertaining to algebraic geometry (14-04)

Related Items

From hyperelliptic to superelliptic curves, Computing minimal Weierstrass equations of hyperelliptic curves, Minimal models of rational elliptic curves with non-trivial torsion, Computing Heights on Elliptic Curves, Computing canonical heights with little (or no) factorization