二次规划(QP)为NP完全问题。
但该类问题推测属于NP完全问题。
However, this kind of problem is conjectured to be a NP complete problem.
图着色问题是著名的NP-完全问题。
The graph coloring problem is a well-known NP-complete problem.
图着色问题(GCP)是NP完全问题。
图的邻强边着色算法是一个NP完全问题。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
生产调度理论与方法研究是一类NP完全问题。
Research on theories and methods of scheduling problem is a kind of NP - complete problems.
组合电路的故障检测问题是一个NP完全问题。
The problem of fault detection in general combinational circuits is a NP-complete problem.
多点网络拓扑结构设计问题是NP-完全问题。
The problem of multipoint network topological design is NP-complete.
一般情况下，这种DAG调度是个NP完全问题。
The DAG scheduling problem has shown to be NP complete in general.
加权图的连通扩充问题已被证明是NP完全问题。
The connected augmentation of weighted graphs is NP hard problem that has been proved.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
在理论上属于NP完全问题，在实际问题上很难解决。
It belongs to NP complete problem in theory, so it's hard to solve in practical problems.
最大团问题是组合优化中的一个经典的NP -完全问题。
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最小反馈节点集问题是一个NP完全问题，很难准确求解。
As the minimum feedback vertex set problem is NP-complete, it is hard to be solved exactly.
最小路径集和流量分配问题(MPSFAP)是NP完全问题。
Minimum path set and flow allocation problem (MPSFAP) were NP complete problems.
本文主要给出发夹结构及分子信标在几个NP完全问题中的应用。
In this paper, hairpin structure and molecular beacons are applied in solving a few NP complete problems.
当您开发一个新的应用时，您要确保您和您的团队首先考虑完全问题。
As you develop new applications you should ensure that you and your entire team are thinking of security up-front.
本文从代数及组合两个方面论证了NP完全问题存在多项式时间算法。
In this paper, the polynimial time algorithms of the NP complete problems are gained in the algebraical and combinatorial two aspects respectively.
第三个问题已被证明是NP完全问题，但这个问题的实际算法还没有。
The third problem has been proved to be NP-complete, but there are few practical algorithms for it.
若要求最大检测时间最小，证明了其是NP完全问题，并给出近似算法。
If the maximum detection time is required to be minimal, the problem is proved to be NP completeness and an approximate algorithm is given.
系统可靠性优化已被证明是一个NP完全问题，不存在精确的求解方法。
Optimization of system reliability is a NP hard problem, and people can not find the precise method for result.
多序列比对问题是NP完全问题，研究快而精确的算法是一个巨大的挑战。
Sequence alignment is a NP Complete problem and a great challenge to any quick and accurate algorithms.
SAT问题是第一个NP-完全问题，并且是一大类NP-完全问题的核心。
SAT problem is the first NP-complete problem and the nucleus of the category of NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem.
然而，裁剪与装填问题是NP-完全问题，很难在有限的合理时间内取得最优解。
However, these kinds of problems are NP-Complete, and it is difficult to give optimal solution within a reasonable time limit.
然而，裁剪与装填问题是NP-完全问题，很难在有限的合理时间内取得最优解。
However, these kinds of problems are NP-Complete, and it is difficult to give optimal solution within a reasonable time limit.
应用推荐