Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
If one hears bad music it is one's duty to drown it by one's conversation.
I don't complain, I don't justify myself, I accept what comes and keep working.
The beauty of mathematics only shows itself to more patient followers.