Along the same lines, co-NP is the class containing the complement problems (i.e. problems with the yes/no answers reversed) of NP problems. It is believed that NP is not equal to co-NP; however, it has not yet been proven. It has been shown that if these two complexity classes are not equal then P is not equal to NP.
यदि पी और सह-एन. पी. को असमान पाया जाता है तो पी और एन. पी. के लिए क्या निहितार्थ प्राप्त किया जा सकता है? 
पी एन. पी. के बराबर नहीं है 