We describe an algorithm to compute the zeta function of any Cab curve over any finite field F-p(n). The algorithm computes a p-adic approximation of the characteristic polynomial of Frobenius by computing in the Monsky-Washnitzer cohomology of the curve and thus generalizes Kedlaya's algorithm for hyperelliptic curves. For fixed p the asymptotic running time for a C-ab curve of genus g over F-p(n) is O(g(5+epsilon)n(3+epsilon)) and the space complexity is O(g(3)n(3)). (c) 2005 Elsevier Inc. All rights reserved.status: publishe
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This metho...
Keywords: nondegenerate curves, zeta function, Monsky-Washnitzer cohomology,Kedlaya's algorithm...
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a fini...
We describe an algorithm to compute the zeta function of any C ab curve over any finite field F p n...
AbstractWe describe an algorithm to compute the zeta function of any Cab curve over any finite field...
We present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite fi...
We present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite fi...
In this thesis we consider the problem of computing the zeta function and the number of rational poi...
Abstract. In this paper we present a p-adic algorithm to compute the zeta function of a nondegenerat...
17 pages. Published in Algorithmic Arithmetic, Geometry, and Coding Theory, Contemporary Mathematics...
32 pagesInternational audienceWe describe an algorithm to count the number of rational points of an ...
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This metho...
The use in cryptography of the group structure on elliptic curves or the jacobians of hyperelliptic ...
Let E_Gamma be a family of hyperelliptic curves defined by Y^2 = Q(X,Gamma) where Q is defined over ...
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This metho...
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This metho...
Keywords: nondegenerate curves, zeta function, Monsky-Washnitzer cohomology,Kedlaya's algorithm...
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a fini...
We describe an algorithm to compute the zeta function of any C ab curve over any finite field F p n...
AbstractWe describe an algorithm to compute the zeta function of any Cab curve over any finite field...
We present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite fi...
We present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite fi...
In this thesis we consider the problem of computing the zeta function and the number of rational poi...
Abstract. In this paper we present a p-adic algorithm to compute the zeta function of a nondegenerat...
17 pages. Published in Algorithmic Arithmetic, Geometry, and Coding Theory, Contemporary Mathematics...
32 pagesInternational audienceWe describe an algorithm to count the number of rational points of an ...
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This metho...
The use in cryptography of the group structure on elliptic curves or the jacobians of hyperelliptic ...
Let E_Gamma be a family of hyperelliptic curves defined by Y^2 = Q(X,Gamma) where Q is defined over ...
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This metho...
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This metho...
Keywords: nondegenerate curves, zeta function, Monsky-Washnitzer cohomology,Kedlaya's algorithm...
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a fini...