ECE 595E Lecture 4: NP-hardness
ECE 595E Lecture 4: NP-hardness
-
1. Lecture 4: NP-hardness
0
00:00/00:00
-
2. Outline
67.13380046713381
00:00/00:00
-
3. Recap from Friday
150.78411745078412
00:00/00:00
-
4. Examples in P
376.77677677677679
00:00/00:00
-
5. Class NP Definition
557.92459125792459
00:00/00:00
-
6. Examples of NP
631.9319319319319
00:00/00:00
-
7. Relationship of P & NP
1156.0560560560562
00:00/00:00
-
8. Relationship of P & NP
1211.0443777110445
00:00/00:00
-
9. Relationship of P & NP
1336.1361361361362
00:00/00:00
-
10. Non-deterministic Turing machi…
1388.3883883883884
00:00/00:00
-
11. Reducibility
1500.9342676009344
00:00/00:00
-
12. NP completeness
1739.4060727394062
00:00/00:00
-
13. Cook-Levin theorem
1823.2565899232566
00:00/00:00
-
14. Web of reductions
2138.2716049382716
00:00/00:00
-
15. Coping with NP-hardness
2265.5321988655323
00:00/00:00
-
16. Related Complexity Classes
2503.2365699032366
00:00/00:00
-
17. What if P=NP?
2606.1061061061064
00:00/00:00
-
18. Next Class
2812.2455789122455
00:00/00:00