Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
政治是可能的艺术,戏剧是不可能性的艺术。