Open In App
Related Articles

GATE | GATE-CS-2014-(Set-1) | Question 48

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
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)? GATECS2014Q48 (A) A (B) B (C) C (D) D

Answer: (D)

Explanation: Clique is an NP complete problem. If one NP complete problem can be solved in polynomial time, then all of them can be. So NPC set becomes equals to P.

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads