Timeline for Smart elliptic curve rational point search given Reg*#Sha
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2012 at 23:32 | comment | added | Junkie | "To make thing fast, they use overcongergent modular symbols to compute it. " I guess it takes time $N^2$ or $N^3$ in the level. They work with twists, to soften this. The classical method can emulate the same idea for twists, as with Elkies (1994), and a paper of Delaunay and Roblot. jtnb.cedram.org/item?id=JTNB_2008__20_3_601_0 | |
| Feb 4, 2012 at 21:31 | history | answered | Chris Wuthrich | CC BY-SA 3.0 |