) Thus the class of NP-complete problems contains the most difficult problems in NP, in the sense that they are the ones most likely not to be in P.
If polynomial time can be utilized within an NP-complete problem, what does the imply P is equal to?
NP