title: NP-hard problems that are not NP-complete are harder?
body: <p>From my understanding, all NP-complete problems are NP-hard but some NP-hard problems are known not to be NP-complete, and NP-hard problems are at least as hard as NP-complete problems.</p>
  
  <p>Is that mean NP-hard problems that are not NP-complete are harder? And how it is harder?</p>