COM SCI 289CO

Current Topics in Computer Theory: Complexity Theory

Description: Lecture, four hours; outside study, eight hours. 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.

Units: 4.0
1 of 1
Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
1 of 1

Adblock Detected

Bruinwalk is an entirely Daily Bruin-run service brought to you for free. We hate annoying ads just as much as you do, but they help keep our lights on. We promise to keep our ads as relevant for you as possible, so please consider disabling your ad-blocking software while using this site.

Thank you for supporting us!