CS 6815

Last Updated

  • Schedule of Classes - February 12, 2019 8:29PM EST
  • Course Catalog - January 26, 2019 2:00PM EST

CS 6815
Pseudorandomness and Combinatorial Constructions

Course information provided by the 2018-2019 Catalog.

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.


Prerequisites/Corequisites Prerequisite: CS 4820.

When Offered Fall.

View Enrollment Information

Syllabi: none

  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  • 17675 CS 6815   LEC 001

  •  
    • TR Bard Hall 140

    • Chattopadhyay, E

  • Instruction Mode: In Person