Not being awkward is NP-hard

This meme got me thinking: That feeling when you’re smart enough to know how awkward you are, but not smart enough to know how not to be awkward The reason it works that way is because not being awkward is NP-hard, and I can prove it. It is known that the SAT problem is NP-hard. SAT, or the satisfiability problem, is the problem of taking a logical statement involving a series of boolean values,…