Related Articles

Related Articles

Algorithms | NP Complete | Question 6
  • Last Updated : 30 Jul, 2013

Which of the following is true about NP-Complete and NP-Hard problems.
(A) If we want to prove that a problem X is NP-Hard, we take a known NP-Hard problem Y and reduce Y to X
(B) The first problem that was proved as NP-complete was the circuit satisfiability problem.
(C) NP-complete is a subset of NP Hard
(D) All of the above
(E) None of the above


Answer: (D)

Explanation: See NP-Completeness


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :