sat.

sat.的基本解释

abbr.

satellite 卫星, 人造卫星, systematic assertive therapy 系统的武断的疗法

相似词

Sat.

与sat.相关的网络例句 [注：此内容来源于网络，仅供参考]

It is proved that if'sparse NP complete sets under polynomial-time Turing reductions exist'then 'SAT is polynomial-time non-adaptively search reducible to decision', and that if 'P is not equal to NP'then either'SAT is not polynomial-time non-adaptively search reducible to decision'or'SAT is not polynomial-time truth-table reducible to bounded approximable sets', and that if'P is not equal to NP'then'sparse complete sets for NP under polynomial-time disjunctive reductions do not exist'.

因为用现有的证明技术不可能绝对地解决这个假设，本文研究了这个假设与其他关于SAT结构性质的假设之间的关系，证明了如果'NP有多项式时间图灵归约下的稀疏完全集'则'SAT是多项式时间并行地搜索归约为判定'，以及如果假设'P不等于NP'，则要么'SAT不是多项式时间并行地搜索归约为判定'，要么'SAT不能用多项式时间真值表归约归约为有界可近似集'。

The satisfiability of conjunction normal form is a typical NP-complete problem. To study the complexity of SAT problem, a new concept of saturated clause muster has been introduced with using the characteristic of saturated clause muster. The sufficient condition of SAT problem was approved to be a polynomial and has opened out essential distinction of 2SAT and 3SAT problems.

合取范式可满足性问题是典型的NP完全问题，本文引入了一个饱和子句集的新概念，利用饱和子句集的特性，研究了SAT问题的复杂性，证明了SAT问题复杂性为多项式的一个充分条件，并揭示了二元可满足性问题与三元可满足性问题的本质差别。

First, a SAT solver is used to determine whether the preimage solution has been exhausted. When a preimage solution is generated by the SAT solver, a specific ATPG process is adopted to minimize the sets of assignments to state variables. This in turn reduces the number of all the preimage solutions and accelerates the fixed point iteration process.

SAT用来判断是否已经穷尽所有解；每次SAT枚举出一个前像解后，采用一个专门的ATPG过程减少状态变量上的赋值，从而减少前像解的总个数，加快后面的不动点迭代处理。

与sat.相关的网络解释 [注：此内容来源于网络，仅供参考]

sat sat：坐

sink 下沉 sank, sunk sunk, sunken | sit 坐 sat sat | slay 残杀 slew slain

sat sat：(使)就座, (使)坐

sing唱, 演唱 sang sung | sit (使)就座, (使)坐 sat sat | sleep睡, 睡觉 slept slept

sat sat：坐下

hide 隐藏 hid hidden | sit 坐下 sat sat | sleep 睡觉 slept slept