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
Data Analysis
Artificial Intelligence
Protecting Business Innovations via Patent
Viral Marketing and How to Craft Contagious Content
Discover Dentistry
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore theoretical computer science with Ryan O'Donnell, focusing on polynomials, including their addition, multiplication, division, and application in error correcting codes. (1-2hr workload)
Explore theoretical computer science with Ryan O'Donnell, focusing on computability, Turing machines, and the Church-Turing Thesis. Expect 1-2 hours of material.
Explore theoretical computer science with Ryan O'Donnell, focusing on proofs, their history, and techniques for finding them. Expect a 1-2 hour workload.
Explore the basics of graphs in theoretical computer science with Ryan O'Donnell. This 1-2 hour material covers definitions, regular graphs, perfect matching, and more.
Explore theoretical computer science with Ryan O'Donnell's online material, focusing on approximation algorithms. Expect 1-2 hours of study.
Explore additive combinatorics in Boolean functions with this CMU graduate-level material, taught by Ryan O'Donnell. Expect a 1-2 hour workload.
Dive into Boolean Functions Analysis with Ryan O'Donnell at CMU. Learn about constraint satisfaction problems, approximation algorithms, and more in 1-2 hours weekly.
Explore Boolean functions with Ryan O'Donnell at CMU. Dive into restrictions, the Goldreich-Levin theorem, and more in this 1-2 hour study. Free textbook included.
Explore the complexity of P vs. NP problem in this 1-2 hour material by Ryan O'Donnell from Carnegie Mellon, covering negative results, Ladner's theorem, and simulations.
Explore computational complexity theory with Ryan O'Donnell from Carnegie Mellon. Dive into topics like time hierarchy theorem, fine-grained complexity, and reduction algorithms in 1-2 hours.
Explore Computational Complexity Theory with Ryan O'Donnell from Carnegie Mellon. Dive into Oracle Turing Machines and P^NP in a 1-2 hour study.
Explore Computational Complexity Theory with Ryan O'Donnell at Carnegie Mellon. Expect 1-2 hours of material including lectures and readings.
Explore randomized complexity, RP, coRP, and ZPP in this 1-2 hour material from Carnegie Mellon, taught by Ryan O'Donnell. Dive into probabilistic Turing Machines and error amplification.
Explore the Immerman--Szelepcsényi Theorem in Computational Complexity Theory with Ryan O'Donnell from Carnegie Mellon. Expect 1-2 hours of material.
Explore computational complexity theory with Ryan O'Donnell at Carnegie Mellon. Dive into topics like P-Completeness, reductions, and PSPACE in just 1-2 hours.
Get personalized course recommendations, track subjects and courses with reminders, and more.