np-complete中文是什么意思

发音:

中文翻译
造句

np完备
np完全

np Np ＝【化学】neptunium 镎。
complete adj. 1.完全的；圆满的，全面的，全能的。 2.完成 ...
amboseli np 安博塞利国家公园
co-np 反np
empilan np 聚氧乙烯壬苯基醚
feng np 冯年平
fiordland np 峡湾国家公园
hot-np neurophysin]人催产素相关后叶激素运载蛋白; 人催产素相关后叶激素运载蛋白
kahurangi np 卡胡朗吉国家公园
kibale np 基巴莱国家公园
lukla np 卢克拉
nakuru np 纳库鲁湖国家公园
nonylphenol np 壬基酚
np nepal 尼泊尔
np (complexity) np (度)
np (度) np (complexity)
np completeness np完全性
np deficiency np缺乏
np-9 壬基苯酚聚乙二醇醚
np-avp vasopressin]血管加压素相关的后叶激素运载蛋白; 血管加压素相关的后叶激素运载蛋白
np-hard 困难性
np缺乏 np deficiency
np完备 np-complete
np完全 np-complete

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

The schedule of this kind of production can be formulated as assigning n parts to m machines . to find the optimal solution is an np - complete problem in theory
该类生产的调度可归结为n种零件需经m类机器加工的复杂非流水型作业系统的排序问题。
Generally speaking , the two - dimensionsl bandwidth problem is known to be np - complete . our main results here are determining the precise value of some graphs
G在映射f下的二维带宽定义为g的二维带宽定义为就一般情形而言，二维带宽问题是np -完全的。
Constructing an evolutionary tree is a typical np - complete problem , therefore it is of great significance to construct an algorithm capable of getting optimal approximate solutions
发生树的构建问题是一个np完全问题,因此,研究构造发生树的近似最优算法有着重要意义。
The traveling salesman problem ( tsp ) is a typical optimization problem , which belongs to a large family of problems classified as np - complete . it has the important project background
旅行商问题( tsp )是一个有着重要工程背景、在图论中的典型组合优化问题，已被证实是一个np完全问题。
A polynomial function of 3 - sat to area minimization was given in a pubilshed thesis , this could prove the area minimization is a np - complete problem . but this must be discussed in there cases : k 5 , k = 4 , and k = 3
原有的证明是利用3 - sat问题规约到面积优化问题,但是要分别对k 5 、 k = 4和k = 3的情况分别讨论,证明过程比较复杂。
The objective of multicast routing optimization is to minimize the network cost with delay constrained . finding a multicast routing tree with minimized network cost is known to be an np - complete problem in the most general case
组播路由优化的目标是在满足时延约束的条件下网络代价最小化，在一般的情况下，这是一个np完全问题。
Genetic algorithm ( ga ) is a high - effective randomly searching algorithm , based on the nature evolution . it is a very effective algorithm to resolve np - completed combination optimization problem
遗传算法是一种借鉴于生物界自然选择和进化机制发展起来的高度并行、自适应的随机搜索算法，是一种非常有效的解决np完全的组合问题的方法。
Two - dimensional irregular shape nesting system is widely used in manufacturing industry , garment , leather and architecture industry . it is a one of the np - complete problem and has been a hot research area for a long time
二维零件的优化排样技术广泛的应用于制造工业、服装、皮革以及建筑行业中，同时也是一个具有最高计算复杂度的np完全问题。
Unfortunately , the problem of finding multicast routing with qos constrained is a np - complete problem . so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra
然而研究表明，由于qos组播路由带有多个qos约束参数，因此qos组播路由问题是一个np完全问题，这使得它与传统的路由过程不同，难以用经典的最短路径优先算法求解。
With the fast develovment of computer technology and molecular biotechnology , dna computing as a new interdispline has been under - develovment , which has great potential in sloving large - scale parallel computation , especially in np - complete problems
随着计算机技术和分子生物技术的迅速发展, dna计算作为一种新兴的交叉学科正逐渐发展起来,在解决大规模并行计算问题上,特别是在解决np -完全问题上有其不可估量的优势。

更多例句： 1 2 3

百科解释

In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC) is a class of decision problems. A decision problem L is NP-complete if it is in the set of NP problems and also in the set of NP-hard problems.

详细百科解释