SAT The Satisfiability Problem的意思|示意
可满足性问题
SAT The Satisfiability Problem的网络常见释义
可满足性问题 SAT缩写对应的词条意思 ... SAT : Saturation n. 饱和(浸透, 磁性饱和, 色度学章度) SAT : The Satisfiability Problem 可满足性问题 SAT : Sant Andreu Teatre (French) 圣·安德鲁Teatre(法国) ...
SAT The Satisfiability Problem相关例句
Satisfiability (SAT) problem has been the core problem of research on computational theory.
可满足性问题(SAT)是当代理论计算机科学的核心问题。
When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiability problem in the first-order logic can be reduced to SAT.
当解释的论域是一个固定大小的有限集合时，一阶逻辑公式的可满足性问题可以等价地归约为SAT 问题。
Finally, the satisfiability of a SAT problem is verified by the covering of orthogonal clause group on the whole assignment space.
最后，根据正交子句组对整个赋值空间的覆盖情况来判断SAT是否满足。
The satisfiability problem of conjunction normal form (abbreviate sat problem) is an NP_complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。