Undergrad Complexity at CMU - The Immerman-Szelepcsényi Theorem

This course on Undergraduate Computational Complexity Theory aims to teach students about The Immerman--Szelepcsényi Theorem. The course covers topics such as Introduction, Solution, Savages Theorem, Safety Idea, Zero Size Analysis, NPCoProofs, and Chapter Processes. The teaching method involves lectures and suggested reading from Sipser Ch. 8.6. This course is intended for undergraduate students interested in computational complexity theory.