-
From Nickvash Kani
All about SAT to Hamiltonian-cycle. Will get to 3-Color next lecture. Audio got cut off at the end. Will re-cover directed/undirected HC next lecture. -
-
From Nickvash Kani
Decidability: - Halting problem proof- Halting language reduction- Empty language reduction- Equal language reduction- Rice's theorem -
From Nickvash Kani
-Introduction to Reductions -Independent set, Clique, Vertex cover -DFA/NFA universalty -Halting problem reduction *Ignore title slide. This is lecture 23. I… -