Kedlaya's Algorithm in Larger Characteristic
From MaRDI portal
Publication:5439938
DOI10.1093/imrn/rnm095zbMath1206.11080arXivmath/0610973OpenAlexW2963736369MaRDI QIDQ5439938
Publication date: 30 January 2008
Published in: International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610973
Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Computational number theory (11Y99)
Related Items (19)
Faster polynomial multiplication via multipoint Kronecker substitution ⋮ Computing zeta functions of arithmetic schemes ⋮ Counting points on curves using a map to \(\mathbf P^1\). II. ⋮ Explicit Vologodsky integration for hyperelliptic curves ⋮ Genus 2 point counting over prime fields ⋮ Computing zeta functions of superelliptic curves in larger characteristic ⋮ Computing zeta functions of cyclic covers in large characteristic ⋮ Explicit Coleman integration in larger characteristic ⋮ Zeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in \(p\)-adic cohomology ⋮ Unnamed Item ⋮ Counting points on hyperelliptic curves in average polynomial time ⋮ Sato-Tate distributions ⋮ 𝑝-adic point counting on singular superelliptic curves ⋮ Fast arithmetic in unramified \(p\)-adic fields ⋮ Explicit Coleman Integration for Hyperelliptic Curves ⋮ A generic approach to searching for Jacobians ⋮ Computing zeta functions of generic projective hypersurfaces in larger characteristic ⋮ Counting points on curves using a map to $\mathbf {P}^1$ ⋮ A cache-friendly truncated FFT
Uses Software
This page was built for publication: Kedlaya's Algorithm in Larger Characteristic
