NP中的每个问题都可以归约为可满足性问题，这是计算复杂性理论的基石。
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
不要看时钟，做它该做的事。继续前进。
The architect must be a guardian of the public realm.
每个成功项目的中间阶段看起来都像一场灾难。
I will tell you what I will do and what I will not do. I will not serve that in which I no longer believe whether it call itself my home, my fatherland, or my church: and I will try to express myself in some mode of life or art as freely as I can and as wholly as I can, using for my defence the only arms I allow myself to use—silence, exile, and cunning.