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
Digital Marketing
Web Development
Information Technology
Introduction to Real-Time Audio Programming in ChucK
Fundamentals of Reinforcement Learning
Introduction to Marketing
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore theoretical computer science with Ryan O'Donnell, focusing on countability and diagonalization. Expect 1-2 hours of material.
Explore theoretical computer science with Ryan O'Donnell, focusing on Turing's legacy. Expect 1-2 hours of material including Turing Machines and programming language.
Explore Markov Chains and their applications with Ryan O'Donnell. Learn about invariant distribution, recurrence theorem, and PageRank in just 1-2 hours.
Learn to analyze random code and understand theoretical ideas in computer science with Ryan O'Donnell's 1-2 hour material.
Explore theoretical computer science with Ryan O'Donnell, focusing on deductive systems, binary tree terminology, and propositional logic. 1-2 hours of material.
Explore theoretical computer science with Ryan O'Donnell, focusing on finite automata and regular languages. Expect 1-2 hours of material.
Explore time complexity with Ryan O'Donnell's material, covering algorithms, running time, and problem-solving paradigms. Requires 1-2 hours of study.
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.
Get personalized course recommendations, track subjects and courses with reminders, and more.