CSCI2560

(Formerly CS256)

Advanced Complexity

Not offered this year
Offered every year, last taught:

Summer 2018

Advanced topics in computational complexity, such as: the polynomial hierarchy, interactive proofs, pseudorandomness, derandomization, probabilistically checkable proofs.

Instructor(s):
CRN:None