We describe an algorithm for computing, for all primes
, the
mod- reduction of the
trace of Frobenius at
of a fixed hypergeometric motive in time quasilinear in
. This
combines the Beukers–Cohen–Mellit trace formula with average polynomial time
techniques of Harvey et al.
Keywords
hypergeometric L-functions, average polynomial time