Suppose a polynomial time algorithm is discovered that correctly computes the…
GATE · 2014 · CS · Set 1 · Computer Science & IT
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 57 students.
Sign up free to check your answer
Sign up freeLoading lesson…