Monday, September 21, 2015

Lecture 15

Randomized Algorithms introduced with primality testing based on Fermat's Little Theorem. Fails to work on Carmichael Numbers so need a different test: Miller-Rabin. Primality was shown to have a deterministic polynomial-time solution  in Agrawal-Kayal-Saxena.

Homework assignment two will be distributed on Friday.