Search for tag: "clique"

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

From  David Doty 0 likes 15 plays 0  

ECS 220 5b:6.6-4 two lemmas and full proof of Ladner_s theorem

From  David Doty 0 likes 14 plays 0  

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

From  David Doty 0 likes 14 plays 0  

ECS 220 5b:6.6-1 Ladner's theorem, existence of NP-intermediate problems

From  David Doty 0 likes 18 plays 0  

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

From  David Doty 0 likes 35 plays 0  

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

From  David Doty 0 likes 26 plays 0  

ECS 120 8c:4 Cook-Levin Theorem if P neq NP, then no NP-complete problem is in P

From  David Doty 0 likes 93 plays 0  

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

From  David Doty 0 likes 123 plays 0  

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.

From  David Doty 0 likes 152 plays 0  

ECS 120 8b:1 reducing IndSet to Clique

From  David Doty 0 likes 155 plays 0  

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

From  David Doty 1 likes 123 plays 0  

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

From  David Doty 1 likes 169 plays 0