40. Which of the following statements is FALSE about NP theory? Group of answer choices A. If we want to prove that a pr
Posted: Sat May 14, 2022 7:32 pm
40. Which of the following statements is FALSE about NP
theory?
Group of answer choices
A. If we want to prove that a problem L is NP-Hard, we take a
known NP-Hard problem X and reduce X to L.
B. If a problem L is NP-hard, and if there exists a
nondeterministic polynomial-time algorithm for solving it, then L
is NP-Complete.
C. CNF-Satisfiability problem has been proven to be
NP-Complete.
D. NP-hard is a subset of NP.
theory?
Group of answer choices
A. If we want to prove that a problem L is NP-Hard, we take a
known NP-Hard problem X and reduce X to L.
B. If a problem L is NP-hard, and if there exists a
nondeterministic polynomial-time algorithm for solving it, then L
is NP-Complete.
C. CNF-Satisfiability problem has been proven to be
NP-Complete.
D. NP-hard is a subset of NP.