Kedlaya's algorithm in larger characteristic

International Mathematics Research Notices

Volumn 2007, Issue , 2007, Pages

  Harvey, David ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67349272736     PISSN: 10737928     EISSN: 16870247     Source Type: Journal    
DOI: 10.1093/imrn/rnm095     Document Type: Article

References (13)

1. Bostan, A., Pierrick, G., and S. Eric. "Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-ManinOperator." SIAM Journal on Computing 36, no.6 (2007): 1777-1806.
2. Chudnovsky, D. V., and G. V. Chudnovsky. "Approximations and Complex Multiplication According to Ramanujan." Pp. 375-472 in Ramanujan Revisited (Urbana-Champaign, Ill., 1987). Boston, MA: Academic Press, 1988.
3. Edited byH. Cohen, et al. Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete Mathematics and its Applications (Boca Raton). Boca Raton, FL: Chapman & Hall/CRC, 2006.
4. Edixhoven, B. Point Counting After Kedlaya'. EIDMA-Stieltjes Graduate Course, Leiden (unpublished lecture notes), (2003): http://www.math.leidenuniv. nl/~edix/oww/mathofcrypt/ carls edixhoven/kedlaya.pdf (retrieved Oct 25th 2006).
5. Gaudry, P., and N. Gürel. "Counting Points in Medium Characteristic Using Kedlaya's Algorithm." Experimental Mathematics 12, no.4 (2003): 395-402.
6. Hanrot, G. Quercia, M. and P. Zimmermann. "The Middle Product Algorithm. I." Applicable Algebra in Engineering Communication and Computing 14, no.6 (2004): 415-438.
7. Hubrechts, H. Point counting in families of hyperelliptic curves, (2007): arXivmath. NT/0601438v3 (retrieved Jan 29th 2007). to appear in Foundations of Computational Mathematics.
8. Kedlaya, K. S. "Counting Points on Hyperelliptic Curves Using Monsky-Washnitzer Cohomology." Journal of the Ramanujan Mathematical Society 16, no.4 (2001): 323-338.
9. -. "Computing Zeta Functions Via p-Adic Cohomology." Pp. 1-17 in Algorithmic Number Theory, Vol.3076 of Lecture Notes in Computer Science. Berlin: Springer, 2004.
10. Mazur, B., W. Stein, and J. Tate. Computation of p-Adic Heights and Log Convergence. DocumentaMathematica (Extra Volume: John H. Coates' Sixtieth Birthday), (2006): 577-614.
11. Shoup, V. NTL: A Library for Doing Number Theory (2007): http://www.shoup.net/ntl/.
12. Stein, W., and D. Joyner. "Sage: System for Algebra and Geometry Experimentation."Communications in Computer Algebra (ACMSIGSAMBulletin) 39, no.2 (2005): 61-64.
13. Strassen, V. "Gaussian Elimination is Not Optimal." Numerische Mathematik 13 (1969): 354-356.