Kedlaya's method for counting points on hyperelliptic curves.

Kedlaya's had the idea of using Monsky-Washnitzer
cohomology to give an explicit computational approach
to the problem of calculating the number of points on
hyperelliptic curves and their Jacobians over large
finite fields of small characteristic. This leads to a
nice, fairly efficient algorithm.

The talk will be on the theory behind this, how it
relates to some other cohomological methods and
implementational details for the algorithm.