成功的关键是在生活的各个方面不断成长。
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.