From Wikipedia: "A problem p in NP is NP-complete if every other problem in NP can be transformed (or reduced) into p in polynomial time". https://en.wikipedia.

From Wikipedia: "A problem p in NP is NP-complete if every other problem in NP can be transformed (or reduced) into p in polynomial time". https://en.wikipedia.org/wiki/NP-completeness https://en.wikipedia.org/wiki/NP-completeness