Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
Don’t be the smartest person in the room. Hangout with, and learn from, people smarter than yourself. Even better, find smart people who will disagree with you.