07:50

ECS 220 5c:6.6 why is it hard to prove P neq NP

09:25

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:35

ECS 220 5b:6.6-2 almost proof of Ladner's…

ECS 220 5b:6.6-2 almost proof of Ladner's theorem

07:45

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:08

ECS 220 5a:6.4-2 P^SAT and P^NP

08:48

ECS 220 2a:4.2-4 Clique, Independent-Set,…

ECS 220 2a:4.2-4 Clique, Independent-Set, Vertex-Cover

03:43

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:53

ECS 120 8b:3 using reductions to bound hardness…

ECS 120 8b:3 using reductions to bound hardness of problems

11:52

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 with the function reduction_from_clique_to_independent_set. This should be reduction_from_independent_set_to_clique instead.

07:22

ECS 120 8b:1 reducing IndSet to Clique

09:55

ECS 120 7c:4 example problem in NP - SubsetSum

07:02

ECS 120 7c:3 example problem in NP - Clique

AggieVideo video portal by Academic Technology ServicesUC Davis | Information and Educational Technology | User Guides and Technical Documentation