Talk:Counting points on elliptic curves
Latest comment: 6 years ago by Jackzhp in topic On Extended Field
 | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Outdated? edit
This article is outdated/incomplete. It should mentions:
- Couveignes variant of SEA for fields of small characteristic (at the very least it should says that plain Elkies variant fails for small characteristic). [[1]]
- Sutherland algorithms for computing modular polynomials. [[2]]
- padic algorithms:
- Satoh algorithm based on the canonical lift and the faster variants. A good reference is [[3]]
- Kedlaya algorithm based on Monsky-Washnitzer cohomology. [[4]]
- I feel that it is pretty relevant! it is pretty good!
On Extended Field edit
The article and majar text deal with only the Finite Field, how to deal with the extended Field? Just add more ?Jackzhp (talk) 13:37, 3 January 2018 (UTC)
