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)?
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)? Correct Answer <img alt="F1 Raju Madhu 07.07.20 D9" src="//storage.googleapis.com/tb-img/production/20/07/F1_Raju_Madhu_07.07.20_D9.PNG" style="width: 216px; height: 100px;">
Clique is in NPC.
By definition of NPC, all NP problems can be reduced to Clique in polynomial time.
So, if clique can be solved in polynomial time, any NP problem can also be solved in polynomial time making P=NP and hence P=NP=NPC.
মোঃ আরিফুল ইসলাম
Feb 20, 2025