11:043-Colorability
A 11-minute video from Computer Science Theory Explained: “3-Colorability”.
Computer Science Theory Explained
4.82K subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
11:04
10:063SAT and Establishing NP-completeness
A 10-minute video from Computer Science Theory Explained: “3SAT and Establishing NP-completeness”.
6:37A Brief Linear Programming Refresher
A 7-minute video from Computer Science Theory Explained: “A Brief Linear Programming Refresher”.
8:18A Dynamic Program for the Knapsack Problem
A 8-minute video from Computer Science Theory Explained: “A Dynamic Program for the Knapsack Problem”.
3:38A Lower Bound for the List Scheduling Algorithm
A 4-minute video from Computer Science Theory Explained: “A Lower Bound for the List Scheduling Algorithm”.
4:38Algorithmic Game Theory - Introduction
A 5-minute video from Computer Science Theory Explained: “Algorithmic Game Theory - Introduction”.
4:54An Approximation Algorithms for MaxSAT
A 5-minute video from Computer Science Theory Explained: “An Approximation Algorithms for MaxSAT”.
13:57An FPTAS for the Knapsack Problem
A 14-minute video from Computer Science Theory Explained: “An FPTAS for the Knapsack Problem”.
6:51Another Dynamic Program for the Knapsack Problem
A 7-minute video from Computer Science Theory Explained: “Another Dynamic Program for the Knapsack Problem”.
4:55Approximation Algorithms
A 5-minute video from Computer Science Theory Explained: “Approximation Algorithms”.
3:16Area-Time Tradeoffs for VLSI Chips
A 3-minute video from Computer Science Theory Explained: “Area-Time Tradeoffs for VLSI Chips”.
8:46Binary vs. Unary Number Encodings and Strong NP-completeness
A 9-minute video from Computer Science Theory Explained: “Binary vs. Unary Number Encodings and Strong NP-completeness”.
16:51Brouwer's Fixed Point Theorem
A 17-minute video from Computer Science Theory Explained: “Brouwer's Fixed Point Theorem”.
19:44Certifying Primality
A 20-minute video from Computer Science Theory Explained: “Certifying Primality”.
14:34Colorability of Planar Graphs
A 15-minute video from Computer Science Theory Explained: “Colorability of Planar Graphs”.
3:40Communication Complexity
A 4-minute video from Computer Science Theory Explained: “Communication Complexity”.
10:42Communication Complexity: a first example
A 11-minute video from Computer Science Theory Explained: “Communication Complexity: a first example”.
7:28Competititive Facility Location
A 7-minute video from Computer Science Theory Explained: “Competititive Facility Location”.
11:58Competitive Facility Location Problem is PSPACE-complete
A 12-minute video from Computer Science Theory Explained: “Competitive Facility Location Problem is PSPACE-complete”.
3:35Complexity Theory - Introduction
A 4-minute video from Computer Science Theory Explained: “Complexity Theory - Introduction”.
3:06Computing a Function
A 3-minute video from Computer Science Theory Explained: “Computing a Function”.
17:39Computing a Nash Equilibrium
A 18-minute video from Computer Science Theory Explained: “Computing a Nash Equilibrium”.
3:48Constructing CNF Formulas
A 4-minute video from Computer Science Theory Explained: “Constructing CNF Formulas”.
6:46Cook Reductions and Oracle Turing Machines
A 7-minute video from Computer Science Theory Explained: “Cook Reductions and Oracle Turing Machines”.
4:38Cook vs. Karp Reductions
A 5-minute video from Computer Science Theory Explained: “Cook vs. Karp Reductions”.
13:42Directed Hamiltonian Cycle
A 14-minute video from Computer Science Theory Explained: “Directed Hamiltonian Cycle”.
3:35Dominating Strategies in the Prisoner's Dilemma
A 4-minute video from Computer Science Theory Explained: “Dominating Strategies in the Prisoner's Dilemma”.
5:46Examples of Turing Machines
A 6-minute video from Computer Science Theory Explained: “Examples of Turing Machines”.
11:17Existence and Computation of Nash Equilibria in Two-Player Zero-Sum Games
A 11-minute video from Computer Science Theory Explained: “Existence and Computation of Nash Equilibria in Two-Player Zero-Sum Games”.
4:00Factoring and Primality Testing
A 4-minute video from Computer Science Theory Explained: “Factoring and Primality Testing”.
5:29Games in Strategic Form
A 5-minute video from Computer Science Theory Explained: “Games in Strategic Form”.
9:18Gödel's Incompleteness Theorem
A 9-minute video from Computer Science Theory Explained: “Gödel's Incompleteness Theorem”.
8:05Hamiltonian Cycle
A 8-minute video from Computer Science Theory Explained: “Hamiltonian Cycle”.
7:35IndependentSet and VertexCover
A 8-minute video from Computer Science Theory Explained: “IndependentSet and VertexCover”.
5:54Karp Reductions
A 6-minute video from Computer Science Theory Explained: “Karp Reductions”.
9:28NP vs coNP
A 9-minute video from Computer Science Theory Explained: “NP vs coNP”.