On the complexity of computing the 2-Selmer group of an elliptic curve

DOI10.1017/S0017089500032183zbMath0915.11032MaRDI QIDQ4370690

Samir Siksek, Nigel P. Smart

Publication date: 2 February 1998

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

algorithmelliptic curvecomplexity estimate2-Selmer group

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Elliptic curves (14H52) Computational aspects of algebraic curves (14Q05)

Related Items (2)

Visualising Sha[2 in Abelian surfaces] ⋮ Computing the $p$-Selmer group of an elliptic curve

Uses Software

• ecdata

Cites Work

• Unnamed Item
• Unnamed Item
• The rank of elliptic curves
• 2-descent on the Jacobians of hyperelliptic curves
• Approximating rings of integers in number fields
• Notes on elliptic curves. I.

This page was built for publication: On the complexity of computing the 2-Selmer group of an elliptic curve