engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
If it is given that, P3 is NP – Hard and P1 is known to be in the class of NP, then which of the following is true ?
1
P = NP
2
A Ɛ P
3
P1 is NP complete
4
P1 is NP Hard but not NP – complete