Hendrik Lenstra,
Carl Pomerance,
and Jonathan Pila
Original Announcement
This workshop is occasioned by the breakthrough result of
Agrawal, Kayal and Saxena devising an unconditional, deterministic,
polynomial-time algorithm for distinguishing prime numbers from
composite numbers. The solution of one of the basic problems in
the discipline ushers in a new era. The main objective of the workshop
is to consolidate the breakthrough and explore ramifications for other
fundamental algorithmic problems in number theory and finite fields.
In addition the workshop will look to the future of the subject and
chart directions in which developments might occur.