Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore fundamental concepts in theoretical computer science through this collection of lectures from Carnegie Mellon University's 15-251 course taught by Ryan O'Donnell across multiple semesters. Delve into essential topics including proof techniques, deductive systems, logic, countability and diagonalization, finite automata, computability theory, and Gödel's incompleteness theorems. Master computational complexity concepts through coverage of time complexity, computational arithmetic, Boolean formulas and circuits, and approximation algorithms. Study graph theory fundamentals and algorithms, probability theory, randomized algorithms, and linear algebra applications in computer science. Examine advanced mathematical foundations including number theory, group theory, polynomials, and fast integer multiplication techniques. Discover cutting-edge topics such as random walks and Markov chains, quantum computing principles, and specialized problems like the Max-Cut optimization challenge. Gain access to comprehensive lecture materials and PDFs through the course website while building upon prerequisites in discrete mathematics and mathematical proofs to understand the theoretical underpinnings that drive modern computer science research and applications.
