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
215 plays 0Undecidability Reductions, Rice's Theorem -
From Dakshita Khurana
259 plays 0More NP hardness, Undecidability -
From Dakshita Khurana
218 plays 0More NP Hardness: Hamiltonian Cycle wrap-up, Hamiltonian Path, other NP-hard problems and general strategies -
From Dakshita Khurana
256 plays 03SAT reduces to 3COLOR, 3SAT reduces to Hamiltonian Cycle -
From Dakshita Khurana
355 plays 0P/NP, NP hardness, circuit SAT, formula SAT, 3SAT, CircuitSAT reduces to 3SAT reduces to CLIQUE -
From Dakshita Khurana
120 plays 0All pairs shortest paths -
From Dakshita Khurana
286 plays 0Shortest paths -
From Dakshita Khurana
322 plays 0DP in DAGs, strongly connected components, generic shortest paths -
From Dakshita Khurana
451 plays 0Depth-first search, Dynamic Programming in DAGs -
From Dakshita Khurana
318 plays 0Graphs: definitions, representations, data structures, traversal -
From Dakshita Khurana
301 plays 0Tree shaped DP: optimal binary search trees -
From Dakshita Khurana
341 plays 0Sequence DP: Edit Distance -
From Dakshita Khurana
405 plays 0Dynamic programming -
From Dakshita Khurana
369 plays 0Backtracking, n-queens, game trees, text segmentation -
From Dakshita Khurana
429 plays 0Divide and conquer: Karatsuba multiplication, linear-time selection -
From Dakshita Khurana
543 plays 0Recursion: Hanoi, Mergesort, Quicksort -
From Dakshita Khurana
202 plays 0Turing Machines -
From Dakshita Khurana
217 plays 0Context Free Languages -
From Dakshita Khurana
358 plays 0Regular expressions to NFAs, Language Transformations -
From Dakshita Khurana
219 plays 0NFAs, epsilon-transitions -
From Dakshita Khurana
264 plays 0Fooling sets, proving nonregularity, NFAs -
From Dakshita Khurana
213 plays 0Product constructions of DFAs, Closure Properties -
From Dakshita Khurana
306 plays 0Languages and Regular Expressions -
From Dakshita Khurana
769 plays 0Introduction, String induction