arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0601438math.NTmath.AG

Point counting in families of hyperelliptic curves

H. Hubrechts

英文摘要:

Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm for computing the zeta function of the curve E_g by using Dwork deformation in rigid cohomology. The time complexity of the algorithm is O(n^(2.667)) and it needs O(n^(2.5)) bits of memory. A slight adaptation requires only O(n^2) space, but costs time O(n^3). An implementation of this last result turns out to be quite efficient for n big enough.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑