engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Suppose that some problem L is known to be NP – Hard but not known to be in the class of NP – complete. Which of the following claims are true ?
I.There exists a deterministic polynomial time algorithm for L.
II.L belongs to the class NP.
III.Satisfiability reduces to L.
IV.There do not exist any algorithm for L in the class of P & NP.
1
I & II
2
III & IV
3
I, II & III
4
III only