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
Programming Languages
Information Technology
Communication Skills
Gamification
Exploratory Data Analysis with MATLAB
Supporting Victims of Domestic Violence
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Dive into Graduate Computational Complexity Theory with Ryan O'Donnell at CMU. Explore the Polynomial Time Hierarchy in a 1-2 hour study.
Dive into graduate-level computational complexity theory with Ryan O'Donnell at CMU, exploring hierarchy theorems in 1-2 hours.
Dive into the Hopcroft-Paul-Valiant Theorem with this 1-2 hour graduate-level complexity theory lecture by Ryan O'Donnell at Carnegie Mellon.
Dive into graduate-level computational complexity theory with Ryan O'Donnell from Carnegie Mellon. Explore circuits, complexity classes, and more in 1-2 hours.
Explore the hardness of approximation with Ryan O'Donnell's tutorial, featuring topics like Max Cuts, Greedy algorithm, and Unique games conjecture. Less than 1-hour workload.
Explore the hardness of approximation with Ryan O'Donnell's tutorial, featuring Fourier analysis and optimal solutions. Expect 1-2 hours of material.
Explore theoretical computer science with Ryan O'Donnell, focusing on time complexity. Expect 1-2 hours of material, including running time definitions and examples.
Explore deterministic finite automata with Ryan O'Donnell's 1-2 hour material, covering computation, algorithms, and regular languages.
Learn to define, add, multiply, divide, and evaluate polynomials with Ryan O'Donnell's 1-2 hour material. Also covers polynomial roots and Lagrange Interpolation.
Explore the theory of algorithmic complexity with Ryan O'Donnell. Learn about approximation algorithms, vertex-cover problems, and the Traveling Salesperson Problem in 1-2 hours.
Explore linear algebra concepts with Ryan O'Donnell in a 1-2 hour study session, covering vector spaces, linear combinations, and applications like Fibonacci sequences.
Explore theoretical computer science with Ryan O'Donnell, focusing on countability and diagonalization. Expect 1-2 hours of material.
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.
Get personalized course recommendations, track subjects and courses with reminders, and more.