Timeline for what is complexity of finding a non-torsion point on elliptic curve
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 5, 2014 at 17:50 | vote | accept | somayeh didari | ||
| Dec 8, 2013 at 14:21 | answer | added | Joe Silverman | timeline score: 2 | |
| Nov 9, 2013 at 9:28 | comment | added | somayeh didari | For computing the rank, we can use the BSD conjecture. The BSD conjecture was proved for the rank one cases. | |
| Nov 8, 2013 at 7:45 | comment | added | stankewicz | How do you know the rank if not by finding generators of a finite index subgroup ? | |
| Oct 9, 2013 at 6:03 | history | edited | somayeh didari | CC BY-SA 3.0 |
added 442 characters in body
|
| Oct 8, 2013 at 17:38 | answer | added | Jesper Petersen | timeline score: 0 | |
| Oct 8, 2013 at 17:19 | comment | added | Alex B. | The question is not well-posed. What are you assuming about $E$? There may not be a single generator. Or $E(\mathbb{Q})$ could be torsion, in which case finding a point of infinite order is going to be very hard indeed. | |
| Oct 8, 2013 at 14:00 | history | edited | somayeh didari | CC BY-SA 3.0 |
added 11 characters in body
|
| Oct 8, 2013 at 13:14 | history | asked | somayeh didari | CC BY-SA 3.0 |