Speaker
Jaikumar Radhakrishnan (ICTS-TIFR, Bengaluru)
Date & Time
Tue, 23 September 2025, 11:30 to 13:00
Venue
Feynman Lecture Hall
Resources
Abstract
We will present the efficient primality testing algorithm of Agrawal, Kayal and Saxena, and the proof of its correctness. The proof will be based on elementary arguments about polynomials. We will not assume prior familiarity with ideas from computer science.