Undergrad Complexity at CMU - Hardness within P

This course on Undergraduate Computational Complexity Theory focuses on the topic of Hardness within P. The learning outcomes include understanding reductions from CNF-SAT to DIAMETER, identifying truth assignment vertices, and analyzing the clique on the clause nodes. The course teaches skills such as applying reduction algorithms, exploring fine-grained complexity, and solving open questions in complexity theory. The teaching method involves lectures and theoretical explanations. The intended audience for this course is undergraduate students interested in computational complexity theory.