The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
The satisfiability problem of conjunction normal form (abbreviate sat problem) is an NP_complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
Satisfiability (SAT) problem has been the core problem of research on computational theory.
可满足性问题(SAT)是当代理论计算机科学的核心问题。
Satisfiability (SAT) problem has been the core problem of research on computational theory.
可满足性问题(SAT)是当代理论计算机科学的核心问题。
应用推荐