39 ms·
Thinking of this way helps me. NP-complete is the intersection of sets NP and NP-hard , but not the part of NP that contains P. Lots of NP-hard problems are n
by nyrikki 3y ago
Thinking of this way helps me.
NP-complete is the intersection of sets NP and NP-hard , but not the part of NP that contains P.
Lots of NP-hard problems are not in NP is important.
- gbacon 3y agoSee this helpful diagram: https://en.wikipedia.org/wiki/NP-hardness#/media/File:P_np_np-complete_np-hard.svg https://en.wikipedia.org/wiki/NP-hardness#/media/File:P_np_n...