P vs. NP NP-Hard A problem X is NP-hard if every problem Y∈NP reduces to X. See NP-Hard If P=NP, then X∈/P.