RSS Amplifier

Topic · cmu lecture

cmu lecture

The 30 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. Inequalities, asymptotics, primes || @ CMU || Homework 1 / Recitation 2 of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  2. The Central Binomial Coefficient || @ CMU || Recitation 1 of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  3. Berry--Esseen Theorem || @ CMU || Lecture 4c of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  4. Gaussian Random Variables || @ CMU || Lecture 4b of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  5. Central Limit Theorem || @ CMU || Lecture 4a of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  6. Binomial Coefficients Asymptotics || @ CMU || Lecture 3c of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  7. Factorial Asymptotics, Stirling's Formula || @ CMU || Lecture 3b of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  8. Birthday Paradox Asymptotics || @ CMU || Lecture 3a of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  9. Asymptotics Tricks || @ CMU || Lecture 2c of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  10. Harmonic Numbers Asymptotics || @ CMU || Lecture 2b of CS Theory ToolkitCS Theory Toolkit at CMUNotes
  11. Analysis of Boolean Functions at CMU - Lecture 15: Constraint satisfacation problemsAnalysis of Boolean Functions at CMUNotes
  12. Analysis of Boolean Functions at CMU - Lecture 14: Probabilistically checkable proofs of proximityAnalysis of Boolean Functions at CMUNotes
  13. Analysis of Boolean Functions at CMU - Lecture 13: Dictator Testing and the FKN TheoremAnalysis of Boolean Functions at CMUNotes
  14. Analysis of Boolean Functions at CMU - Lecture 12: Bonami's Lemma and the KKL TheoremAnalysis of Boolean Functions at CMUNotes
  15. Analysis of Boolean Functions at CMU - Lecture 11: Level-1 inequality and the 2/pi TheoremAnalysis of Boolean Functions at CMUNotes
  16. Analysis of Boolean Functions at CMU - Lecture 10: LTFs and noise stabilityAnalysis of Boolean Functions at CMUNotes
  17. Analysis of Boolean Functions at CMU - Lecture 9: Majority, LTFs, and the CLTAnalysis of Boolean Functions at CMUNotes
  18. Analysis of Boolean Functions at CMU - Lecture 8: Linial--Mansour--Nisan TheoremsAnalysis of Boolean Functions at CMUNotes
  19. Analysis of Boolean Functions at CMU - Lecture 7: DNF formulasAnalysis of Boolean Functions at CMUNotes
  20. Analysis of Boolean Functions at CMU - Lecture 6: Restrictions and the Goldreich--Levin TheoremAnalysis of Boolean Functions at CMUNotes
  21. Undergrad Complexity at CMU - Lecture 15: coNPUndergrad Complexity Theory at CMUNotes
  22. Undergrad Complexity at CMU - Lecture 14: Ladner's Theorem and Mahaney's TheoremUndergrad Complexity Theory at CMUNotes
  23. Undergrad Complexity at CMU - Lecture 13: Search-to-Decision, Padding, Dichotomy TheoremsUndergrad Complexity Theory at CMUNotes
  24. Undergrad Complexity at CMU - Lecture 12: NP-Completeness ReductionsUndergrad Complexity Theory at CMUNotes
  25. Undergrad Complexity at CMU - Lecture 11: NP-Completeness and the Cook--Levin TheoremUndergrad Complexity Theory at CMUNotes
  26. Undergrad Complexity at CMU - Lecture 10: ReductionsUndergrad Complexity Theory at CMUNotes
  27. Undergrad Complexity at CMU - Lecture 9: NondeterminismUndergrad Complexity Theory at CMUNotes
  28. Undergrad Complexity at CMU - Lecture 8: NPUndergrad Complexity Theory at CMUNotes
  29. Undergrad Complexity at CMU - Lecture 7: SATUndergrad Complexity Theory at CMUNotes
  30. Undergrad Complexity at CMU - Lecture 6: Problems in PUndergrad Complexity Theory at CMUNotes