RSS Amplifier

Topic · computational complexity

computational complexity

The 15 most recent episodes and tracks on this topic.

Saves to your Watch queue, to pick up on another day or another device.

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

  1. CSE104, Lec 16: Introduction to circuit complexityCSE104, Fall 2020: Computational ComplexityNotes
  2. CSE104, Lec 15: More on the polynomial hierarchyCSE104, Fall 2020: Computational ComplexityNotes
  3. CSE104, Lec 14: The polynomial hierarchyCSE104, Fall 2020: Computational ComplexityNotes
  4. CSE104, Lec 13: NL = co-NL, the Immerman-Szelepcsenyi theoremCSE104, Fall 2020: Computational ComplexityNotes
  5. CSE104, Lec 11: Logspace reductions and NL-completenessCSE104, Fall 2020: Computational ComplexityNotes
  6. CSE104, Lec 12: Read-once certificates for NL, starting NL=co-NLCSE104, Fall 2020: Computational ComplexityNotes
  7. CSE104, Lec 10: QBF is PSPACE-complete, the notion of logspace reductionsCSE104, Fall 2020: Computational ComplexityNotes
  8. CSE104, Lec 9: Savitch's theorem, PSPACE = NPSPACECSE104, Fall 2020: Computational ComplexityNotes
  9. CSE104, Lec 8: EXP vs NEXP and the time hierarchy theoremCSE104, Fall 2020: Computational ComplexityNotes
  10. CSE104, Lec 7: co-NP and the factoring problemCSE104, Fall 2020: Computational ComplexityNotes
  11. CSE104, Lec 5: The proof of the Cook-Levin theorem and the NP-completeness of 3SATCSE104, Fall 2020: Computational ComplexityNotes
  12. CSE104: Lec 4, NP-completeness, the Cook-Levin TheoremCSE104, Fall 2020: Computational ComplexityNotes
  13. CSE104: Lec 3, the definitions of P and NPCSE104, Fall 2020: Computational ComplexityNotes
  14. CSE104, Lec 2: Turing machine simulationsCSE104, Fall 2020: Computational ComplexityNotes
  15. CSE104, Computational Complexity: Lec 1, Cantor's diagonalizationCSE104, Fall 2020: Computational ComplexityNotes