P vs. NP

NP-Hard

A problem is NP-hard if every problem reduces to . See NP-Hard

  • If , then .