| 释义 |
SAT-problem
基本例句
问题¹⁰⁰
The satisfiability problem of conjunction normal form is an NP_complete problem.合取范式可满足性问题是一个NP完全问题。
An algorithm in finding minimal reduction based on Propositional Satisfiability algorithm is proposed.A branch and bound algorithm is presented to solve the proposed SAT problem.本文提出了一种求最小约简的基于命题可满足性的算法,提出一个解决SAT问题的分割和结合的算法。
Recently, local search methods for solving the SAT problem have attracted considerable attention because they are the best known approaches to several hard classes of satisfiability.摘要局部搜索方法在求解SAT问题的高效率使其成为一研究热点。
Biomolecular computing has been successfully applied in computing NP complete problems such as Hamiltonion path problem, maximal clique problem and SAT problems in Boolean calculation, etc.生物分子计算已成功地应用于计算哈密顿路径、最大集合以及逻辑运算中的SAT类问题等 NP完全问题。
Models of Sat Problem Based on DNA Computing可满足性问题的几种DNA计算模型 |