...
GATE 2021 CS-Set-2
October 12, 2023
Artificial-intelligence
October 12, 2023
GATE 2021 CS-Set-2
October 12, 2023
Artificial-intelligence
October 12, 2023

P-NP

Question 8

For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE?

A
If X can be solved in polynomial time, then so can Y
B
X is NP-complete
C
X is NP-hard
D
X is in NP, but not necessarily NP-complete
Question 8 Explanation: 
Note: Out of syllabus.
Correct Answer: D
Question 8 Explanation: 
Note: Out of syllabus.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!