0
/ 1.0
Show a proof that the decision form of INDEPENDENT SET is NP-complete by using a reduction from known NP-complete problem CLIQUE.
X523: Clique to Independent Set (Simplified)
Show a proof that the decision form of INDEPENDENT SET is NP-complete by using a reduction from known NP-complete problem CLIQUE.
Your Answer:
Feedback
Your feedback will appear here when you check your answer.