Topics in Pseudorandomness and Complexity

Spring 2018

(198:540)

 

Instructor: Swastik Kopparty (swastik.kopparty@gmail.com)

 

 

Homework

·       All homework in one file

·       Scribe notes: sample file, definitions

 

Lecture Schedule

·       January 18: randomized algorithms, s-t connectivity (notes)

·       January 25: expander graphs (notes)

·       February 1: applications of expanders, zig-zag product (notes)

·       February 8: derandomized s-t connectivity (notes)

·       February 15: k-wise independence (notes)

·       February 22: epsilon-biased sets (notes)

·       March 1: almost k-wise independence, pseudorandomness (notes)

·       March 8: randomness extractors, pseudorandomness against small space (notes)

·       March 15: NO CLASS

·       March 22: pseudorandomness against small space, randomized primality testing (notes)

·       March 29: deterministic primality testing

·       April 5:

·       April 12:

·       April 19:

·       April 26: