Quoted By:
Boolean satisfiabililty is NP complete. Meaning if you are given an arbitrary logical expression made up of binary variables with AND and OR operators, and you can decide whether the statement can be true for some variables in a runtime bounded by a polynomial, then P=NP.