If it’s an NP-complete [0] problem like SAT, as many NP problems are, then we are done, because all NP problems can be reduced to it (in polynomial time).

[0] https://en.wikipedia.org/wiki/P_versus_NP_problem#NP-complet...