Fall 2021 CS 374 Algos and Models of Computation Section A
Fall 2021 CS 374 Algos and Models of Computation Section A
-
From Dakshita Khurana
216 plays 0Undecidability Reductions, Rice's Theorem -
From Dakshita Khurana
260 plays 0More NP hardness, Undecidability -
From Dakshita Khurana
222 plays 0More NP Hardness: Hamiltonian Cycle wrap-up, Hamiltonian Path, other NP-hard problems and general strategies -
From Dakshita Khurana
257 plays 03SAT reduces to 3COLOR, 3SAT reduces to Hamiltonian Cycle -
From Dakshita Khurana
358 plays 0P/NP, NP hardness, circuit SAT, formula SAT, 3SAT, CircuitSAT reduces to 3SAT reduces to CLIQUE -
From Dakshita Khurana
121 plays 0All pairs shortest paths -
From Dakshita Khurana
289 plays 0Shortest paths -
From Dakshita Khurana
324 plays 0DP in DAGs, strongly connected components, generic shortest paths -
From Dakshita Khurana
458 plays 0Depth-first search, Dynamic Programming in DAGs -
From Dakshita Khurana
322 plays 0Graphs: definitions, representations, data structures, traversal -
From Dakshita Khurana
302 plays 0Tree shaped DP: optimal binary search trees -
From Dakshita Khurana
348 plays 0Sequence DP: Edit Distance -
From Dakshita Khurana
411 plays 0Dynamic programming -
From Dakshita Khurana
370 plays 0Backtracking, n-queens, game trees, text segmentation -
From Dakshita Khurana
432 plays 0Divide and conquer: Karatsuba multiplication, linear-time selection -
From Dakshita Khurana
550 plays 0Recursion: Hanoi, Mergesort, Quicksort -
From Dakshita Khurana
209 plays 0Turing Machines -
From Dakshita Khurana
229 plays 0Context Free Languages -
From Dakshita Khurana
366 plays 0Regular expressions to NFAs, Language Transformations -
From Dakshita Khurana
230 plays 0NFAs, epsilon-transitions -
From Dakshita Khurana
273 plays 0Fooling sets, proving nonregularity, NFAs -
From Dakshita Khurana
220 plays 0Product constructions of DFAs, Closure Properties -
From Dakshita Khurana
312 plays 0Languages and Regular Expressions -
From Dakshita Khurana
796 plays 0Introduction, String induction