Satisfiability的例句大全

The satisfiability problem is a key problem in computer science and artificial intelligence.

这是计算机科学和人工智能中的重要问题之一.

The research of this paper is based on the Boolean Satisfiability ( SAT ) Problem of combinational circuit.

本文研究工作是针对可满足问题 ( SAT ) 在组合电路验证和测试中的应用展开的.

Two heuristic strategies for solving satisfiability ( SAT ) problem were presented.

提出了两个用于求解可满足性 ( SAT ) 问题的启发式策略.

The satisfiability problem of conjunction normal form ( abbreviate SAT problem ) is an NP _ complete problem.

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

It is proved that the SEE' satisfiability is solvable in the polynomial time by means of giving a concrete deterministic Turing Machine.

通过给出具体的确定型图林机，证明了SBE的可满足性（SAT）问题在多项式时间内可解。