-
Final exam review. Assortment of practice problems.
CSECE374-SP21-BL1 Lecture 28
From Nickvash Kani
69 plays 0 -
Directed -> Undirected HC SAT -> 3Color SAT <-> Circuit-SAT
CSECE374-SP21-BL1 Lecture 27
From Nickvash Kani
51 plays 0 -
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.
CSECE374-SP21-BL1 Lecture 26
From Nickvash Kani
63 plays 0 -
- SAT - Complexity Classes - NP/NP-Complete - SAT to Independent Set reduction
CSECE374-SP21-BL1 Lecture 25
From Nickvash Kani
105 plays 0 -
Decidability: - Halting problem proof- Halting language reduction- Empty language reduction- Equal language reduction- Rice's theorem
CSECE374-SP21-BL1 Lecture 24
From Nickvash Kani
132 plays 0 -
-Introduction to Reductions -Independent set, Clique, Vertex cover -DFA/NFA universalty -Halting problem reduction *Ignore title slide. This is lecture 23. I…
CSECE374-SP21-BL1 Lecture 23
From Nickvash Kani
129 plays 0 -
-
Shortest path on DAG and Floyd-Warshall
CSECE374-SP21-BL1 Lecture 21
-
-
-
-
Directed graphs, DAGs and topological sort
CSECE374-SP21-BL1 Lecture 17
-
Independent sets in trees and Graph basics
CSECE374-SP21-BL1 Lecture 16
-
More DP: text segmentation and edit distance
CSECE374-SP21-BL1 Lecture 15
-
Dynamic programming
CSECE374-SP21-BL1 Lecture 14
-
-
Karatsuba's algorithm
CSECE374-SP21-BL1 Lecture 12
-
-
Midterm 1 review
CSECE374-SP21-BL1 Lecture 10
From Nickvash Kani
73 plays 0 -
Turing machine variants and universal Turing machines
CSECE374-SP21-BL1 Lecture 9
From Nickvash Kani
71 plays 0 -
Context-Free and Context-Sensitive Languages and Turing machines
CSECE374-SP21-BL1 Lecture 8
From Nickvash Kani
136 plays 0 -
-
Regular Language Closure
CSECE374-SP21-BL1 Lecture 6
From Nickvash Kani
245 plays 0 -
-
-
-
Regular languages and expressions
CSECE374-SP21-BL1 Lecture 2
From Nickvash Kani
193 plays 0 -
Administrivia, strings, and languages
CSECE374-SP21-BL1 Lecture 1
From Nickvash Kani
309 plays 0
Search for ""