RSS Amplifier

Topic · boolean functions

boolean functions

The 20 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. The Quantum Computing Advantage - Prof. Ryan O'DonnellRyan O'Donnell Theoretical Computer Science TalksNotes
  2. Ryan O'Donnell (CMU) -- Learning quantum statesRyan O'Donnell Theoretical Computer Science TalksNotes
  3. TCS+ Talk: Ryan O'DonnellRyan O'Donnell Theoretical Computer Science TalksNotes
  4. Explicit near-Ramanujan graphs of every degreeRyan O'Donnell Theoretical Computer Science TalksNotes
  5. X-Ramanujan GraphsRyan O'Donnell Theoretical Computer Science TalksNotes
  6. Ryan O'Donnell @ Theory LunchRyan O'Donnell Theoretical Computer Science TalksNotes
  7. X-Ramanujan graphs: ex uno plures - Ryan O'DonnellRyan O'Donnell Theoretical Computer Science TalksNotes
  8. Ryan O'Donnell on "Optimal Mean-based Algorithms for Trace Reconstruction"Ryan O'Donnell Theoretical Computer Science TalksNotes
  9. Ryan O'Donnell tutorial on Hardess of Approximation - Part 2Ryan O'Donnell Theoretical Computer Science TalksNotes
  10. Ryan O'Donnell tutorial on Hardess of Approximation - Part 3Ryan O'Donnell Theoretical Computer Science TalksNotes
  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