Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
gptkb:hyperelliptic_curves
finite fields |
| gptkbp:citation |
Kiran S. Kedlaya, Counting points on hyperelliptic curves using Monsky–Washnitzer cohomology, Duke Math. J. 97 (2001), no. 1, 1–57.
|
| gptkbp:complexity |
polynomial time in genus and log of field size
|
| gptkbp:computes |
zeta function of hyperelliptic curves over finite fields
|
| gptkbp:field |
gptkb:mathematics
number theory arithmetic geometry |
| gptkbp:improves |
gptkb:Schoof's_algorithm_(for_certain_cases)
|
| gptkbp:introduced |
gptkb:Kiran_S._Kedlaya
|
| gptkbp:introducedIn |
2001
|
| gptkbp:publishedIn |
gptkb:Duke_Mathematical_Journal
|
| gptkbp:relatedTo |
gptkb:Weil_conjectures
cryptography point counting |
| gptkbp:uses |
gptkb:p-adic_cohomology
|
| gptkbp:bfsParent |
gptkb:Kiran_Kedlaya
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kedlaya's algorithm
|