Select the desired Level or Schedule Type to find available classes for the course. |
CSCI 2560 - Advanced Complexity |
Advanced topics in computational complexity, such as: the polynomial hierarchy, interactive proofs, pseudorandomness, derandomization, probabilistically checkable proofs.
0.000 OR 1.000 Credit hours 0.000 OR 1.000 Lecture hours Levels: Graduate, Undergraduate Schedule Types: Discussion Section/Conference, Primary Meeting Computer Science Department |
Return to Previous | New Search |