SAT problem is the first NP-complete problem and the nucleus of the category of NP-complete problems.
SAT问题是第一个NP-完全问题，并且是一大类NP-完全问题的核心。
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完全问题。
Finally, the satisfiability of a SAT problem is verified by the covering of orthogonal clause group on the whole assignment space.
最后，根据正交子句组对整个赋值空间的覆盖情况来判断SAT是否满足。
Basic thinking of DNA computing is introduced in this paper, then the solution of SAT problem is introduced. After this, we introduce the principle and design of molecular beacons.
本文首先介绍了dna计算的基本思想，然后介绍发夹结构在解决SAT问题上的应用，再介绍发夹结构的一种特殊形式-分子信标的原理和设计方法。
They sat down to consider the problem.
他们坐下来考虑这一问题。
I sat down beside him, trying to think out the problem.
我在他身旁坐下，准备好好考虑一下那个问题。
He sat quietly, turning over the problem.
他静静地坐在那里，思考着那个问题。
But we just sat on the runway due to a problem in the control tower.
但其实我们也就是呆在跑道上，因为控制塔台出问题了。
I sat quietly, turning over the problem.
我悄然默默地坐在那里，思索着这个问题。
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 问题。
Satisfiability (SAT) problem has been the core problem of research on computational theory.
可满足性问题(SAT)是当代理论计算机科学的核心问题。
Andy sat down at the table and inquired as to what the problem was.
安迪在桌边落座，询问出了什么问题。
Two heuristic strategies for solving satisfiability (sat) problem were presented.
提出了两个用于求解可满足性(SAT)问题的启发式策略。
I sat mulling over my problem without finding a solution.
我坐着一遍又一遍地思考我的问题，可总是找不到解决办法。
I sat down beside him trying to think out the problem.
我在他身旁坐下准备好好考虑一下这个问题。
I sat down beside him trying to think out the problem.
我在他身旁坐下准备好好考虑一下这个问题。
应用推荐