Counting Points : Theory,
Algorithms and Practice

April 19 – 23, 2010
Organizers: K. Kedlaya (MIT), J.-F. Mestre (Paris 7)

The development of efficient (polynomial time) algorithms for counting the number of points on varieties over finite fields represents a highly attractive area of application, in part because it relies on sophisticated mathematical theories like the étale and p-adic cohomology theories whose development was a cornerstone of number theory in the second half of the 20th century. The workshop will be devoted to recent advances in this area and its applications.