Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
"Innovation is the key to success."
"Attention is the selective mechanism of consciousness."