📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    âš¡ Month End Offer - Flat 52% Off On All Courses! Enroll Now âš¡
    00:00:00 AM Left

    Question

    A problem is said to be NP-hard if:

    A It can be solved in polynomial time. Correct Answer Incorrect Answer
    B It is at least as hard as the hardest problems in NP. Correct Answer Incorrect Answer
    C It is in the P class. Correct Answer Incorrect Answer
    D It has a non-deterministic solution. Correct Answer Incorrect Answer

    Solution

    It is at least as hard as the hardest problems in NP.

    Practice Next

    Relevant for Exams:

    ask-question