Courses of Study 2018-2019 
    
    Aug 20, 2019  
Courses of Study 2018-2019 [ARCHIVED CATALOG]

[Add to Favorites]

CS 6815 - Pseudorandomness and Combinatorial Constructions


     
Fall. 4 credits. Student option grading.

Prerequisite: CS 4820 .

E. Chattopadhyay.

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.



[Add to Favorites]