Algorithms
October 15, 2023Digital-Logic-Design
October 15, 2023GATE 2009
|
Question 14
|
Let πA be a problem that belongs to the class NP. Then which one of the following is TRUE?
|
There is no polynomial time algorithm for πA.
|
|
|
If πA can be solved deterministically in polynomial time,then P = NP.
|
|
|
If πA is NP-hard, then it is NP-complete.
|
|
|
πA may be undecidable.
|
Question 14 Explanation:
Note: Out of syllabus.
Correct Answer: C
Question 14 Explanation:
Note: Out of syllabus.
Subscribe
Login
0 Comments