title: I need to solve an NP-hard problem. Is there hope?
body: <p>There are a lot of real-world problems that turn out to be <a href="https://en.wikipedia.org/wiki/NP-hard" rel="noreferrer"><strong>NP</strong>-hard</a>. If we assume that <strong>P</strong> &ne; <strong>NP</strong>, there aren't any polynomial-time algorithms for these problems.</p>
  
  <p>If you have to solve one of these problems, is there any hope that you'll be able to do so efficiently? Or are you just out of luck?</p>