1) NP-complete hard
NP完全难
1.
The optimized scheduling problem is NP-complete hard in the computer field and the paper discusses the simulation calculation of the cultural algorithm for solving the problem.
优化调度问题是计算机领域的NP完全难问题,论文探讨了求解该问题的改进文化算法仿真计算。
2) NP complete
NP完全
1.
The relationship between discrete computational models and continuous models and the computational power of the Turing machine are discussed, and the definitions of the NP complete problem are generalized in the paper.
本文讨论了离散模型与连续问题的关系以及图灵机的计算能力,在此基础上扩充了问题及 NP完全问题的定义,根据解空间的拓扑结构特点将NP完全的Packing问题分为三类,并对多边形 Packing问题进行了有益的探讨。
2.
Presented a formal model for Web services composition problem(WSC) and proved that WSC is NP complete.
本文对服务组合问题进行规划建模,证明了该问题是NP完全的,提出了一种基于图的自动组合方法ASC-Graph,ASC-Graph分为组合规划图构造阶段和组合解搜索阶段。
4) NP-completeness
NP-完全性
1.
For the subclasses LCNF≥k of LCNF, in which formulas have only clauses of length at least k, the NP-completeness of the decision problem LSAT≥k is closely relevant to whether or not ther.
LCNF≥k是子句长度大于或等于k的CNF公式子类,判定问题LSAT≥k的NP-完全性与LCNF≥k中是否含有不可满足公式密切相关。
5) NP-complete
NP-完全
1.
The NP-completeness of The Path Chromatic Number Problem of Graphs;
图的路色数问题的NP－完全性
2.
2-Induced-Matching Partition Problem and 2-Induced-Matching Cover Problem of Graphs with Diameter 5 are NP-complete
直径为5的图的2-导出匹配划分和2-导出匹配覆盖问题的NP-完全性(英文)
补充资料：[3-(aminosulfonyl)-4-chloro-N-(2.3-dihydro-2-methyl-1H-indol-1-yl)benzamide]
分子式：C16H16ClN3O3S
分子量：365.5
CAS号：26807-65-8
性质：暂无
制备方法：暂无
用途：用于轻、中度原发性高血压。
分子量：365.5
CAS号：26807-65-8
性质：暂无
制备方法：暂无
用途：用于轻、中度原发性高血压。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条