Courses from 1000+ universities
Coursera sees headcount decrease and faces lawsuit in 2023, invests in proprietary content while relying on Big 5 partners.
600 Free Google Certifications
Business Intelligence
Programming Languages
Graphic Design
Shakespeare Matters
Understanding the GDPR
Nutrition, Exercise and Sports
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore combinatorial theorems about the RSK process in quantum states with Ryan O'Donnell. Less than an hour of engaging material.
Explore high-dimensional expanders, graphs of constant link, and group theory applications in this under 1-hour presentation by Ryan O'Donnell.
Explore the laws of quantum computing using a single qubit and understand the Elitzur-Vaidman 'bomb-detection algorithm' in this 1-2 hour material by Ryan O'Donnell.
Explore quantum data analysis with Ryan O'Donnell's talk on Quantum Shadow Tomography, offering insights into adaptive data analysis. Less than 1-hour workload.
Dive into the three standard parts of Irit Dinur's proof of the PCP Theorem with Ryan O'Donnell at Carnegie Mellon University. Less than 1-hour workload.
Explore deterministic communication complexity with Ryan O'Donnell at Carnegie Mellon University. Learn about protocols, combinatorial rectangles, and the Log Rank conjecture in under an hour.
Explore treewidth definitions, CSPs, and series-parallel graphs in this less than 1-hour material by Ryan O'Donnell at Carnegie Mellon University. Ideal for theoretical CS research.
Explore Constraint Satisfaction Problems (CSPs) and the Dichotomy Theorem with Ryan O'Donnell at Carnegie Mellon University. This less than 1-hour material is part of a semester-long graduate program on CS theory.
Learn to efficiently find graph cuts with Ryan O'Donnell's lecture at Carnegie Mellon University, part of a semester-long graduate program on math and CS fundamentals for theoretical research.
Explore Max-Cut SDP relaxation and efficient solutions with the Ellipsoid Algorithm in this less than 1-hour material by Ryan O'Donnell at Carnegie Mellon University.
Learn to solve Linear Programming in polynomial time with the Ellipsoid Algorithm, a part of the CS Theory Toolkit, taught by Ryan O'Donnell at Carnegie Mellon University.
Explore Linear Programming's feasibility and bit complexity in this less than 1-hour material by Ryan O'Donnell at Carnegie Mellon University. Delve into math and CS fundamentals for theoretical research.
Dive into Linear Programming Duality with Ryan O'Donnell at Carnegie Mellon University. In less than an hour, explore Farkas Lemma, Fourier-Motzkin elimination, and more.
Explore how to decrease the error of a randomized algorithm using expander graphs in this less than 1-hour material by Ryan O'Donnell at Carnegie Mellon University.
Explore explicit expander graph constructions in this less than 1-hour material by Ryan O'Donnell at Carnegie Mellon University. Gain insights into math and CS fundamentals for theoretical computer science research.
Get personalized course recommendations, track subjects and courses with reminders, and more.