We describe an algorithm to compute the zeta function of a cyclic
cover of the projective line over a finite field of characteristic
that runs
in time
.
We confirm its practicality and effectiveness by reporting on the performance of our
SageMath implementation on a range of examples. The algorithm relies on
Gonçalves’s generalization of Kedlaya’s algorithm for cyclic covers, and Harvey’s
work on Kedlaya’s algorithm for large characteristic.