Comment by hcs

Relatedly, even though Boolean Satisfiability [1] is NP-complete, there are SAT solvers that can solve huge practical instances fast enough to be useful.

1: https://en.wikipedia.org/wiki/Boolean_satisfiability_problem