Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques

Assuming P\(\neq \)NP, which of the following is true? 

1
NP–complete = NP 
2
NP–complete  \(\cap \) P=\(\phi\)
3
 NP–hard = NP 
4
P = NP–complete 
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters