Satisfiability(SAT) Problem

The Satisfiability Problem
from: http://mathworld.wolfram.com/NP-CompleteProblem.html

Deciding whether a given Boolean formula in conjunctive normal form has an assignment that makes the formula "true." In 1971, Cook showed that the problem is NP-complete.

可满足性问题（The Satisfiability Problem，简称SAT）是计算机科学的中心问题之一，也是第一个被证明的NP完全问题。

(从算法科学来的知识都要还给老师了>_<)