engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
We assume that, P != NP, then which of the following statements is true ?
1
NP – hard = NP
2
P = NP – complete
3
NP – complete = NP
4
NP – complete ⋂ P = ϕ