She was discouraged, however, to find that the NP-DNA did not decrease protein production as expected.
然而，她发现NP—DNA不能像期盼中的那样减少蛋白质产生量，感到很失望。
Until this week Areva NP was an example of a successful partnership between French and German companies in a promising industry.
直到本周，阿海珐核电公司仍是法德两国在这一前景光明的领域成功合作的一个典范。
= NP, a few days ago, caused lots of enthusiasm in the programming community - at least for a couple days, until the first reviewers showed several flaws in the proof.
=NP的证据,这在编程界引起了不小的兴趣——至少为此狂热了好几天，直到开始有评论家指出证据中有很多的缺陷。
It became a shareholder in Areva NP not just by contributing money, but by bringing Germany's entire nuclear-power industry to the venture.
成为阿海珐的股东，西门子不仅贡献了资金，而且还将德国全套核能技术带入了这家合资企业。
Meanwhile, for "NP" problems, a solution might be very hard to find — perhaps requiring billions of years' worth of computation — but once found, it is easily checked.
而另一方面，对于“NP”类问题来说，答案可能很难解得——可能需要数十亿年的时间进行计算——但一旦得到了答案，它很容易检验。
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
The stickiness of the NP-DNA might enhance the speed and accuracy of such a drug-delivery system.
NP—DNA的粘性可以增加这种药物运送系统的速度和准确性。
In fact, she had some unsettling data suggesting that instead of inhibiting translation, the NP-DNA were boosting it.
事实上，她还得到了一些令人不安的试验数据，试验显示NP—DNA不但没有抑制转化，反而促进蛋白质的产生。
Most of the research in Computer Science these days is devoted to time efficiency, particularly the theoretical time barrier of NP-Complete problems (like the Traveling Salesman problem).
不过现如今的许多计算机科学研究更加关注时间效率，特别是NP完全问题中的理论时间边界(比如旅行商人问题，这是完全NP中一个重要的问题，译者注)。
And that now must be the frictional force, because NP is still the frictional force.
这肯定是摩擦力，因为NP还是摩擦力。
Migrate existing technology, including Command Destruct Systems and the Cast Glance stabilized photo-optical system, into the NP-3C aircraft;
将现存技术，包括指挥破坏系统和投掷扫视稳定光照片系统，移植到NP-3C飞机上；
In principle, by putting a set of entangled qubits into a suitably tuned magnetic field, the optimal solution to a given NP-complete problem can be found in one shot.
基本上，通过将一组纠缠的量子放置于一适宜调谐的磁场中，那么给定的NP完全问题的最佳解决方案就可以立马搞定。
Programmers and computer scientists have been buzzing for the past week about the latest attempt to solve one of the most vexing questions in computer science: the so-called "p versus NP problem."
程序员与计算机科学家上周都在热议对计算机科学中最令人困惑的问题——所谓的“P与NP问题”——的最新解答。
The Clay Mathematics Institute in Cambridge, MA, has named "P versus NP" as one of its "Millennium" problems, and offers $1 million to anyone who provides a verified proof.
麻省的剑桥克莱数学研究院（Clay Mathematics Institute）将“P 与NP”列为其“千年（Millennium）”问题之一，并为任何作出有效证明的人提供 1 百万美元的奖金。
Siemens AG, the German conglomerate, transferred its nuclear assets to the newly created Areva in exchange for a 34% interest in Areva NP, the group's reactor-making arm.
德国工业巨头西门子公司(SiemensAG)将旗下核资产转移到新成立的Areva，换取后者下属核反应堆制造分公司ArevaNP 34%的股份。
Under the Next-Generation Range Support aircraft (NGRSA) contract, L-3 will migrate existing systems from three P-3A-based NP-3D aircraft to three newer P-3C airframes.
根据下一代射程支撑飞机(NGRSA)合同，L - 3公司将把三架基于P -3a的NP - 3d飞机现存系统移植到三架新型P - 3c机身。
Force Protection produces the basic vehicle, with U.K. company NP Aerospace modifying the machine to local requirements.
ForceProtection公司生产了该基本车辆，与英国的NP航空航天公司一起修改该机器以满足当地的要求。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
Solving NP hard problems is always the bottleneck task for computer science and techniques.
求解np难问题一直是计算机科学技术中的一个瓶颈任务。
Assuming you are looking for general case answer, I am sorry to say - but this problem is NP-Complete.
假设你正在寻找的答案一般情况下，我很抱歉，但是这个问题NP完全。
Reduction and core are two important concepts in rough set theory, while computing reductions and core according to the definitions directly is a typical NP problem.
约简与核是粗糙集理论的两个重要概念，而直接由定义来计算约简与核是一个典型的NP难题。
Coloring of conflict graphs has been used in high level synthesis to map operators, values and data transfers onto Shared resources, however, finding a minimum sized coloring is NP hard problem.
高层次综合中通过对冲突围着色方式把操作、变量值、数据传输映射到共享资源中，然而寻找图着色所需的最小颜色数目是个NP难题。
Objective. To determine the expression of leptin and its functional receptor in herniated disc tissues, and to elucidate whether leptin can stimulate rat NP cells to proliferate in vitro.
目的：确定瘦素及其功能受体在脱出间盘组织中的表达，阐明瘦素是否能促进鼠np细胞在体外的增殖。
It has been proved that computing most of these new vulnerability parameters are NP-hard.
但已被证明的是计算一般图的这些参数是NP-困难问题。
Because of NP property, we will propose an heuristic algorithm to solve the problem.
由于该问题是NP -完备的，我们给出了一个启发式算法。
Because of NP property, we will propose an heuristic algorithm to solve the problem.
由于该问题是NP -完备的，我们给出了一个启发式算法。
应用推荐