Advanced Topics in Algorithms and Complexity

198:596, Spring 2020

WARNING: THIS COURSE IS NOT THE MASTERS LEVEL CS 596 COURSE ON MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE OFFERED IN FALL

This is an advanced PhD level course that will cover recent results in theoretical computer science. The required background is what is covered in CS 513/538 and MATH 581/582.

Course Info

Instructor: Swastik Kopparty (swastik.kopparty@gmail.com)
Class Time and Place: Fridays 10:20 am - 1:20 pm, in BBB (Livingston Campus)
Office Hours: Wednesdays 1:30-2:30pm in Hill 432
Prerequisites: graduate level combinatorics/probability, algorithms and mathematical maturity; undergraduate level linear algebra
No required text book.

Syllabus

This course will cover assorted recent results in complexity theory and algorithms. We will see topics such as:

There will be 2-3 problem sets. Students will be expected to scribe one or two lectures.

Latex files for scribes: definitions, main file, guidelines

Lecture Schedule