NP中的每个问题都可以归约为可满足性问题,这是计算复杂性理论的基石。
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
艺术家必须是不可能之物的梦想家。
The spiritual life is not a life of negation, but of affirmation.