Algorithms | NP Complete | Question 3

Last Updated :
Discuss
Comments
Let X be a problem that belongs to the class NP. Then which one of the following is TRUE?
There is no polynomial time algorithm for X.
If X can be solved deterministically in polynomial time, then P = NP.
If X is NP-hard, then it is NP-complete.
X may be undecidable.

This question is part of this quiz :

Top MCQs on NP Complete Complexity with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy