All
01:25:00duration 1 hour 25 minutes
ECS20 - W23 - Lecture 19 (10T): Graphs
Lecture of 2022-03-08. Example of graphs.…
07:50duration 7 minutes 50 seconds
ECS 220 5c:6.6 why is it hard to prove P neq NP
09:25duration 9 minutes 25 seconds
ECS 220 5b:6.6-4 two lemmas and full proof of…
ECS 220 5b:6.6-4 two lemmas and full proof of Ladner_s theorem
07:35duration 7 minutes 35 seconds
ECS 220 5b:6.6-2 almost proof of Ladner's…
ECS 220 5b:6.6-2 almost proof of Ladner's theorem
07:45duration 7 minutes 45 seconds
ECS 220 5b:6.6-1 Ladner's theorem, existence…
ECS 220 5b:6.6-1 Ladner's theorem, existence of NP-intermediate problems
06:08duration 6 minutes 8 seconds
ECS 220 5a:6.4-2 P^SAT and P^NP
08:48duration 8 minutes 48 seconds
ECS 220 2a:4.2-4 Clique, Independent-Set,…
ECS 220 2a:4.2-4 Clique, Independent-Set, Vertex-Cover
03:43duration 3 minutes 43 seconds
ECS 120 8c:4 Cook-Levin Theorem if P neq NP, then…
ECS 120 8c:4 Cook-Levin Theorem if P neq NP, then no NP-complete problem is in P
06:53duration 6 minutes 53 seconds
ECS 120 8b:3 using reductions to bound hardness…
ECS 120 8b:3 using reductions to bound hardness of problems
11:52duration 11 minutes 52 seconds
ECS 120 8b:2 definition of polynomial-time…
ECS 120 8b:2 definition of polynomial-time reducibility
Errata: starting at 8:30, I show Python code…
07:22duration 7 minutes 22 seconds
ECS 120 8b:1 reducing IndSet to Clique
09:55duration 9 minutes 55 seconds
ECS 120 7c:4 example problem in NP - SubsetSum
07:02duration 7 minutes 2 seconds
ECS 120 7c:3 example problem in NP - Clique
01:09duration 1 minute 9 seconds
VEN 101C: Week 6 - Video 1