
CSE104, Fall 2020: Computational Complexity
Dormant Last read · last published · next check
Read 1 day ago and current, but nothing has been published for 6 years.
Latest videos


CSE104, Lec 15: More on the polynomial hierarchy

CSE104, Lec 14: The polynomial hierarchy

CSE104, Lec 13: NL = co-NL, the Immerman-Szelepcsenyi theorem

CSE104, Lec 11: Logspace reductions and NL-completeness

CSE104, Lec 12: Read-once certificates for NL, starting NL=co-NL

CSE104, Lec 10: QBF is PSPACE-complete, the notion of logspace reductions

CSE104, Lec 9: Savitch's theorem, PSPACE = NPSPACE

CSE104, Lec 8: EXP vs NEXP and the time hierarchy theorem

CSE104, Lec 7: co-NP and the factoring problem

CSE104, Lec 5: The proof of the Cook-Levin theorem and the NP-completeness of 3SAT

CSE104: Lec 4, NP-completeness, the Cook-Levin Theorem

CSE104: Lec 3, the definitions of P and NP

CSE104, Lec 2: Turing machine simulations

