Suppose a polynomial time algorithm is discovered that correctly computes the…

PYQ GATE 2014

Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?

Attempted by 77 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…