Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
统计学家不能逃避理解他所应用或推荐的过程的责任。
The method of psychology must be as exact as that of the physical sciences.