Undergrad Complexity at CMU - From P-Completeness to PSPACE-Completeness

This course covers undergraduate computational complexity theory, focusing on the topic of NP. The learning outcomes include understanding P-completeness, reductions, clauses, logspace, the Cook-Levin Theorem, and PSPACE-completeness. The teaching method involves lectures and suggested readings. The course is intended for undergraduate students interested in computational complexity theory.