Counting (quickly) the number of solutions of equations in finite fields
From MaRDI portal
(Redirected from Counting (quickly) the number of solutions of equations in finite fields)
Counting solutions of Diophantine equations (11D45) Curves over finite and local fields (11G20) Varieties over finite and local fields (11G25) Number-theoretic algorithms; complexity (11Y16) Étale and other Grothendieck topologies and (co)homologies (14F20) (p)-adic cohomology, crystalline cohomology (14F30) Finite ground fields in algebraic geometry (14G15) Arithmetic varieties and schemes; Arakelov theory; heights (14G40)
Recommendations
Cited in
(9)- Counting solutions to equations in many variables over finite fields
- A point counting algorithm for cyclic covers of the projective line
- An effective bound for the Huber constant for cofinite Fuchsian groups
- Genus 2 point counting over prime fields
- Faster p-adic feasibility for certain multivariate sparse polynomials
- Counting solutions to some polynomial equations over finite fields
- scientific article; zbMATH DE number 2086874 (Why is no real title available?)
- Randomized polynomial-time root counting in prime power rings
- Counting roots for polynomials modulo prime powers
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)