Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
NP中的每个问题都可以归约为可满足性问题，这是计算复杂性理论的基石。
预测未来的最好方式就是创造未来。
The best leaders listen more than they speak—understanding comes before action.
大脑是一个并行处理器，能够同时处理多个信息流。
The only justice is to follow the sincere intuition of the soul, angry or gentle. Anger is just, and pity is just, but judgement is never just.
