Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
时间是最好的老师,但不幸的是,它杀死了所有的学生。