COM SCI 289CO
Current Topics in Computer Theory: Complexity Theory
Computer Science · 4 units · Graduate courses (200-299)
Diagonalization, polynomial-time hierarchy, PCP theorem, randomness and de-randomization, circuit complexity, attempts and limitations to proving P does not equal NP, average-case complexity, one-way functions, hardness amplification. Problem sets and presentation of previous and original research related to course topics.
Letter grading.
Requisites
UCLA lists no requisites for this course.
Requires
Everything that has to come before this course, not just the courses named in the requisite above.
Nothing — this is an entry point.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.