Return to Colloquia & Seminar listing
Primality testing with pseudofields
Colloquium| Speaker: | Hendrik Lenstra, UC Berkeley and Universiteit Leiden |
| Location: | 693 Kerr |
| Start time: | Mon, May 19 2003, 4:10PM |
In the summer of 2002, the three Indian computer scientists Agrawal, Kayal, and Saxena proved that there exists a deterministic primality test that runs in polynomial time. The lecture will discuss progress that has been booked since this result was announced. In particular, it will be explained how the notion of a `pseudofield' can be used to significantly reduce the proven run time of the test.
There will be a dinner in honor of Professor Lenstra after the talk.