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

例句与用法

Time - table problem is a np - complete problem
排课表问题是np -完全问题。
The vrp can be regarded as an extension of the tsp and it is np - complete
车辆路径问题可以看作是旅行售货员问题的推广，它是np -完备的问题。
The crossing number of graph , which is an np - complete problem , has an important theory meaning
图的交叉数问题属于np -困难问题，对它的研究有重要的理论意义。
Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局问题是具有np完备计算复杂度的离散组合优化问题。
This problem refers to constructing minimum - cost spanning trees constrained by delay , which is known to be np - complete
该问题的目标是创建一棵覆盖源节点和目的节点的代价最小树,且满足端到端时延要求。
Timetabling problem ( tp ) is a multiobjective combination optimization problem with constraints , and also has been proved np - completed
排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个np完全问题。
Scheduling problems are known to be in general np - complete , only sub - optimal can be obtained by classical scheduling approaches in most cases
任务分配与调度问题是一类np问题，经典调度理论一般仅能获得问题的近似最优解。
And of all scheduling problems , the job - shop scheduling problem ( jsp ) is most common and complicate , which is usually a typical np - complete problem
本文主要介绍了约束满足神经网络( csnn )在作业车间调度问题( jsp )中的应用。
The quasi - physical and quasi - sociological methods for problem - solving is a new approach to solve problems including np - completed and other pure mathematical problems
拟物拟人方法是一种求解诸如np问题和其它困难数学问题的方法。
Three - dimensional component packing is a combinatorial optimization and np - complete problem . it is difficult to find its exact global optimum
三维布局问题属于组合最优化问题和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.

详细百科解释