RSS Amplifier

Video feed

CSE104, Fall 2020: Computational Complexity

youtube.comSource feed ↗15 videos

Dormant Last read · last published · next check
Read 1 day ago and current, but nothing has been published for 6 years.

Written by

Latest videos

CSE104, Lec 16: Introduction to circuit complexity

Play

CSE104, Lec 15: More on the polynomial hierarchy

Play

CSE104, Lec 14: The polynomial hierarchy

Play

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

Play

CSE104, Lec 11: Logspace reductions and NL-completeness

Play

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

Play

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

Play

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

Play

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

Play

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

Play

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

Play

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

Play

CSE104: Lec 3, the definitions of P and NP

Play

CSE104, Lec 2: Turing machine simulations

Play

CSE104, Computational Complexity: Lec 1, Cantor's diagonalization

Play