Computer Science and Mathematics lectures by Ryan O'Donnell //
Online research talks, plus full course lecture videos for:
1. CS Theory Toolkit (grad course, assumes basic undergrad CS Theory)
2. Quantum Computer Programming in 100 Easy Lessons (undergrad & below course, assumes basic programming and probability)
3. Quantum Computing and Information (grad course, assumes basic undergrad linear algebra and CS Theory)
4. Undergraduate Complexity Theory (corresponds to Part III of Sipser's text; assumes familiarity with O(), Turing Machines)
5. Graduate Complexity Theory (assumes undergrad complexity theory)
6. Analysis of Boolean Functions (grad course, assumes some undergrad CS Theory and math sophistication)
7. Great Ideas In Theoretical Computer Science (undergrad course, incomplete, assumes basic Discrete Math / Proofs)
---
Portrait sketches by Ticha Sethapakdi: www.tichamelody.com/
Grey cube logo by a.a.williams: www.amandawilliams.com.au/wordpress/
Computer Science and Mathematics lectures by Ryan O'Donnell //
Online research talks, plus full course lecture videos for:
1. CS Theory Toolkit (grad course, assumes basic undergrad CS Theory)
2. Quantum Computer Programming in 100 Easy Lessons (undergrad & below course, assumes basic programming and probability)
3. Quantum Computing and Information (grad course, assumes basic undergrad linear algebra and CS Theory)
4. Undergraduate Complexity Theory (corresponds to Part III of Sipser's text; assumes familiarity with O(), Turing Machines)
5. Graduate Complexity Theory (assumes undergrad complexity theory)
6. Analysis of Boolean Functions (grad course, assumes some undergrad CS Theory and math sophistication)
7. Great Ideas In Theoretical Computer Science (undergrad course, incomplete, assumes basic Discrete Math / Proofs)
---
Portrait sketches by Ticha Sethapakdi: www.tichamelody.com/
Grey cube logo by a.a.williams: www.amandawilliams.com.au/wordpress/