-
-
-
Class recording
NP-hardness: Vertex Cover to Subset Sum, why…
-
Class recording
NP-hardness: Vertex cover to Hamiltonian cycle
-
Class recording
P vs NP, NP-hardness, 3SAT, reduction to max…
-
Class recording
Reductions: Cliques and friends, Hamiltonian…
-
Warning: I initially solved problem 3 completely wrong, but I recovered at the last minute. Watch me make a mistake!!
Midterm 2 Practice 3
-
Class recording
Bellman-Ford via layering and all-pairs shortest…
-
Class recording
Shortest paths via Dijkstra and Bellman-Ford
-
Class recording
Dag DP; generic shortest paths, DagSSSP, BFS
-
Class recording
Graph layering, WFS variants, depth-first search,…
-
Class recording
Graphs: definitions, representations, data…
-
Class recording
Tree-shaped dynamic programming: woodcutting,…
-
Class recording
Sequence dynamic programming: Edit distance
-
Class recording
Dynamic programming: Fibonacci, text segmentation…
-
Class recording
Backtracking: n queens, game trees, text…
-
Class recording
Divide and conquer: selection, multiplication
-
Class recording
Recursion: Hanoi, mergesort, quicksort
-
Yay! The audio worked this time! (Well, except for sporadic short dropouts because my home internet sucks.)
Midterm 1 Practice 2 (redo with sound)
-
Unfortunately, my audio settings were messed up when I recorded this, so there is no sound.
Midterm 1 Practice 2 (no sound)
-
-
Class recording
Context-free languages and grammars
-
Class recording
Language transformations
-
Class recording
NFAs: ε-transitions, equivalence with…
-
Class recording
Proving nonregularity via fooling sets; NFAs:…
-
Class recording
Sep 04: DFAs: product construction, closure,…
Search for ""
Public, Restricted
- Managers: