Finally, the satisfiability of a SAT problem is verified by the covering of orthogonal clause group on the whole assignment space.
最后,根据正交子句组对整个赋值空间的覆盖情况来判断SAT是否满足。
SAT problem belongs to the NP class, that is, theoretically it can't be solved in polynomial time and solving it exceeds the capability of modern computer.
SAT问题是NP完全问题,从理论上说,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问题上的应用,再介绍发夹结构的一种特殊形式-分子信标的原理和设计方法。