Computer Science
149 LECTURES · PAGE 4 OF 7
A Complexity Lower Bound on Algebra Isomorphisms
Extended VC-dimension and Radon Type Theorems for Unions of Convex Sets
Lecture 17: Huffman Coding
AI Literacies and Evaluation: AI + Open Education Initiative Speaker Series
Lecture 4: Counting
A General Quantum Duality for Representations of Groups, with Applications to Quantum Money, Lightning, and Fire
An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC Learning
Neighborhood Complexes, Kneser Graphs, and the Borsuk-Ulam Theorem
Learning from Complexity II
On SNARGs for NP and Nullstellensatz Proofs
Introduction to Deep Learning
Product of Random Matrices: From Scaling Limits to Neural Networks
Learning from Complexity
A Probabilistic Construction of Bipartite Ramanujan Graphs
Color-avoiding Paths
List Decoding: Algebraic and Combinatorial
Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR
Reverse Mathematics of Complexity Lower Bounds, Part II
Locally Decodable Codes and Representations of Finite Groups
Numerical Modeling of Plasmas Across Fluid and Kinetic Regimes
Frontier Systems: Opening Lecture
Random Geometric Graphs
Learning from Complexity III
CS229 Machine Learning, Lecture 7: Neural Networks 1 (Architecture)