Essence of NP-completeness
We haven’t a clue, so when we’re given a problem we can’t solve efficiently, we try to find whether it is equivalent to other problems we can’t solve efficiently.
Hundreds (thousands?) of equivalently hard NP-complete problems of immense practical importance. (scheduling, resource allocation, hardware design and test,……..)