20230823-Aug 22_ Strings and Induction.zh_en
20230824-Aug 24_ Induction, languages, and regular expressions.zh_en
20230829-Aug 29_ DFA introduction.zh_en
20230831-Aug 31_ DFA product construction.zh_en
20230905-Sep 5_ Fooling sets and intro to NFAs.zh_en
20230907-Sep 07_ NFA variations and (most of) Kleene’s theorem.zh_en
20230912-Sep 12_ Language transformations.zh_en
20230914-Sep 14_ Context-free grammars.zh_en
20230919-Sep 19_ Turing machines.zh_en
20230921-Sep 21_ Midterm 1 review (redo).zh_en
20230926-Sep 26_ Recursion.zh_en
20230928-Sep 28_ Divide and conquer.zh_en
20231003-Oct 3_ Backtracking.zh_en
20231005-CS 374 lecture capture.zh_en
20231010-Oct 10_ Dynamic programming_ Edit distance.zh_en
20231012-Oct 12_ Tree-shaped dynamic programming.zh_en
20231017-Oct 18_ Graph representations and traversal.zh_en
20231019-Oct 20_ Depth-first search, dags, and strong components.zh_en
20231024-Oct 24_ topological sort, dag dynamic programming, shortest paths.zh_en
20231026-Oct 26_ Dijkstra and Bellman-Ford.zh_en
20231031-Oct 31_ Bellman-Ford again, all-pairs shortest paths.zh_en
20231102-Nov 02_ Practice Midterm 2.zh_en
20231105-Nov 04_ Second practice Midterm 2.zh_en
20231107-Nov 7_ Polynomial-time reductions.zh_en
20231109-Nov 9_ P, NP, NP-hardness, SAT, 3SAT, reduction to Max Independent Set
-Nov 14_ More on NP hardness, reduction from vertex cover to Hamiltonian cycle
20231116-Nov 16_ NP-hardness_ Why bother, choosing a good problem to reduce from
20231128-Nov 28_ Undecidability.zh_en
20231130-Nov 30_ Undecidability proofs.zh_en
20231205-Dec 5： Final exam review (part 2) .zh_en
20231205-Dec 5_ Final exam review (part 1).zh_en
20231207-Dec 7_ Second practice final walkthrough.zh_en
