• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Algorithms | NP Complete | Question 3

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.


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments