The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem.

• 合取范式可满足性问题(简称SAT问题)是一个NP完全问题。