New Upcoming Legal Jobs Free Workshop March 11 at 5 PM. Register here

    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: