Counting (quickly) the number of solutions of equations in finite fields
zbMATH Open1189.11059arXivmath/0611584MaRDI QIDQ3548596FDOQ3548596
Authors: Antoine Chambert-Loir
Publication date: 16 December 2008
Full work available at URL: https://arxiv.org/abs/math/0611584
Recommendations
Varieties over finite and local fields (11G25) Étale and other Grothendieck topologies and (co)homologies (14F20) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) (p)-adic cohomology, crystalline cohomology (14F30) Finite ground fields in algebraic geometry (14G15) Arithmetic varieties and schemes; Arakelov theory; heights (14G40) Counting solutions of Diophantine equations (11D45)
Cited In (8)
- Randomized polynomial-time root counting in prime power rings
- Counting roots for polynomials modulo prime powers
- Genus 2 point counting over prime fields
- An effective bound for the Huber constant for cofinite Fuchsian groups
- Counting solutions to equations in many variables over finite fields
- A point counting algorithm for cyclic covers of the projective line
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials
- Title not available (Why is that?)
This page was built for publication: Counting (quickly) the number of solutions of equations in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548596)