University of Cambridge > > Churchill CompSci Talks > The AKS primality test explained

The AKS primality test explained

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland.

One of the simplest decision problems you can state in number theory is: “is this number prime?”. The first algorithm capable of answering this question efficiently – AKS – was only published in 2002.

I will explain how the algorithm works and prove its correctness. At the end, we will reflect on what general lessons Computer Science students can take away from AKS .

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity