Fall 2021 CS 374 Algos and Models of Computation Section A
Public, Restricted and Moderated
29
Media
2
Members
Lecture Recordings for Section A for the Fall 2021 offering of CS 374
-
From Dakshita Khurana 11/18/2021
More NP Hardness: Hamiltonian Cycle wrap-up, Hamiltonian Path, other NP-hard problems and general strategies -
-
From Dakshita Khurana 11/11/2021
P/NP, NP hardness, circuit SAT, formula SAT, 3SAT, CircuitSAT reduces to 3SAT reduces to CLIQUE -
-
-
-
-
-
-