CS 6815

Last Updated

  • Schedule of Classes - April 13, 2023 2:00PM EDT
  • Course Catalog - April 12, 2023 7:14PM EDT

CS 6815
Pseudorandomness and Combinatorial Constructions

Course information provided by the 2022-2023 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

  • 17893 CS 6815   LEC 001

  •  
    • TR Hollister Hall 401
    • Aug 22 - Dec 5, 2022

    • Chattopadhyay, E

  • Instruction Mode: In Person

    Restricted to graduate students only. All others must add themselves to the waitlist during add/drop.