Algorithmic theory of zeta functions over finite fields
From MaRDI portal
Recommendations
Cited in
(18)- Computing zeta functions for ordinary formal groups over finite fields.
- Sums-of-squares formulas over algebraically closed fields
- Computing zeta functions of large polynomial systems over finite fields
- Exponential sums over finite fields
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
- Rigid cohomology and \(p\)-adic point counting
- Counting points on hyperelliptic curves in average polynomial time
- Rationality and meromorphy of zeta functions
- Zeta and L-functions of varieties and motives
- Asymptotic methods in number theory and algebraic geometry
- Computing zeta functions of arithmetic schemes
- scientific article; zbMATH DE number 1936555 (Why is no real title available?)
- scientific article; zbMATH DE number 2162677 (Why is no real title available?)
- Asymptotic properties of zeta-functions over finite fields
- Lectures on zeta functions over finite fields
- Randomized polynomial-time root counting in prime power rings
- Counting roots for polynomials modulo prime powers
- Betti number bounds for varieties and exponential sums
This page was built for publication: Algorithmic theory of zeta functions over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615933)