Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
都说女儿是妈妈的小棉袄,可我是我妈的貂。