In the solution to part 2 question 3, We are given an example:

L_{1} = Clique

L_{2} = Complement(Independent Set)

Why is L_{1} U L_{2} NP-hard? More specifically, How do we reduce some NPC problem to this problem? (In polynomial time)

- Instructors
- Prof. Nachum Dershowitz

Prof. Yishay Mansour - Assistants
- Ori Lahav

Mariano Schain

- Exam: Jul. 3
^{rd} - Moed B: Sep. 6
^{th}

**Exam moed B**

(11 Sep 2011 17:01)

**Exam**

(21 Jul 2011 07:22)

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License