Timeline for Algorithms for finding rational points on an elliptic curve?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3 at 20:28 | comment | added | Guruprasad | @JamesWeigandt given link is not working | |
| Jul 9, 2012 at 1:13 | history | edited | James Weigandt | CC BY-SA 3.0 |
added 104 characters in body
|
| Jul 5, 2012 at 19:10 | comment | added | James Weigandt | Thanks for clarifying that John. I'm sorry was confused about that. | |
| Feb 4, 2012 at 17:37 | comment | added | John Cremona | A late postscript to comment on William Stein's comment. The only thing deprecated is my distribution of mwrank independently, either as source code or as a binary, since the source code is 100% included in Sage's distribution, and to run it when you have Sage is as simple as typing "sage -mwrank" if you want to. This makes life simpler for me, which his a good thing (at least for me). I still use mwrank stand-alone myself (hardly surprising). Secondly, Jamie's remark about mwrank in Sage being more up to date is simply nonsensical. | |
| Nov 20, 2010 at 21:14 | comment | added | William Stein | Regarding "Sage over the standalone version of mwrank": In fact, Cremona has even deprecated the standalone version. See the note here: warwick.ac.uk/~masgaj/mwrank Also, it is worth mentioning Denis Simon's algebraic 2-descent code, which is also in Sage, and can be fast in certain case. | |
| Oct 14, 2010 at 6:20 | vote | accept | Andrej Bauer | ||
| Oct 13, 2010 at 18:29 | history | answered | James Weigandt | CC BY-SA 2.5 |