πŸ“’ Too many exams? Don’t know which one suits you best? Book Your Free Expert πŸ‘‰ call Now!

  • google app store apple app store
  • βœ–

      Question

      The question of whether P = NP is one of the most

      famous open problems in computer science. Which statement best describes this question?
      A P is a subset of NP. Correct Answer Incorrect Answer
      B NP is a subset of P. Correct Answer Incorrect Answer
      C P is equivalent to NP. Correct Answer Incorrect Answer
      D P and NP are unrelated complexity classes. Correct Answer Incorrect Answer

      Solution

      P is equivalent to NP.

      Practice Next

      Relevant for Exams:

      ask-question