On the complexity of computing the 2-Selmer group of an elliptic curve (Q4370690): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Approximating rings of integers in number fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The rank of elliptic curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Notes on elliptic curves. I. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 2-descent on the Jacobians of hyperelliptic curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3139838 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3710637 / rank | |||
Normal rank |
Latest revision as of 10:05, 28 May 2024
scientific article; zbMATH DE number 1100629
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of computing the 2-Selmer group of an elliptic curve |
scientific article; zbMATH DE number 1100629 |
Statements
On the complexity of computing the 2-Selmer group of an elliptic curve (English)
0 references
2 February 1998
0 references
elliptic curve
0 references
algorithm
0 references
2-Selmer group
0 references
complexity estimate
0 references