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
Psychology
Digital Skills
Graphic Design
Modelli di insegnamento nella ricerca educativa
Technical Report Writing for Engineers
Making Successful Decisions through the Strategy, Law & Ethics Model
Organize and share your learning with Class Central Lists.
View our Lists Showcase
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.
Explore Savitch's Theorem and NL in this 1-2 hour material from Carnegie Mellon, taught by Ryan O'Donnell. Dive into computational complexity theory, pseudocode, and recursion.
Explore Computational Complexity Theory with Ryan O'Donnell from Carnegie Mellon. Learn about NP, algorithms, and verification in a 1-2 hour workload.
Explore Computational Complexity Theory with Ryan O'Donnell at Carnegie Mellon. Learn about Boolean Circuits, Algorithms, and CNF in just 1-2 hours.
Explore computational complexity theory with Ryan O'Donnell at Carnegie Mellon. Learn about simulations, Turing machine variants, and problem-solving in 1-2 hours.
Explore Turing Machines and Computational Complexity Theory in this 1-2 hour program by Ryan O'Donnell at Carnegie Mellon University.
Dive into graduate-level computational complexity theory with Ryan O'Donnell at CMU, exploring hierarchy theorems in 1-2 hours.
Get personalized course recommendations, track subjects and courses with reminders, and more.