CS 6815

CS 6815

Course information provided by the Courses of Study 2019-2020.

Topics in computational complexity theory focusing on the use of randomness. Topics include pseudorandom generators, randomness extractors, and applications to explicit constructions of combinatorial objects. The course project will involve an in-depth study on a topic introduced in class (based on relevant research papers), with the expectation to produce a high quality survey article and a final presentation.

When Offered Fall.

Prerequisites/Corequisites Prerequisite: CS 4820.

View Enrollment Information

Enrollment Information
Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  • 12786CS 6815  LEC 001