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 vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
Multiprocessor Scheduling Problem ( MSP ) is one of the basic problems in "The Design and Analysis of computer Algorithms" , and is a NP-Problem.
多处理机调度问题是“算法设计与分析”中的基本问题之一，它是一个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难题。
From calculation point of view, machines and parts classification is NP problem in nature.
从计算的观点来看，机床零件分组本质上是NP问题。
Blanking layout is a NP problem, and is widely needed in the industry.
冲裁件的排样是一个NP问题，在工业界具有广泛的需求。
But the attribute reduction is a NP problem, the attribution reduction and decision rule reduction will be solved by method of elicitation.
但是属性约简是一个NP问题，对属性的约简和决策规则的约简只能通过启发式算法实现。
It is very difficult to solute NP problem with current technology because the set of feasible solutions is very huge.
NP问题的解空间太大导致利用现有技术求解十分困难。
The Capacitated Plant Location Problem (CPLP) is a NP problem and hard to get an optimal and satisfactory solution.
容量受限的工厂选址问题属于NP难题，较难得到最优解和满意解。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
Sequence alignment is a NP Complete problem and a great challenge to any quick and accurate algorithms.
多序列比对问题是NP完全问题，研究快而精确的算法是一个巨大的挑战。
Optimization of system reliability is a NP hard problem, and people can not find the precise method for result.
系统可靠性优化已被证明是一个NP完全问题，不存在精确的求解方法。
Quadratic programming (QP) is an NP complete problem.
二次规划(QP)为NP完全问题。
The connected augmentation of weighted graphs is NP hard problem that has been proved.
加权图的连通扩充问题已被证明是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完全问题，并给出近似算法。
It belongs to NP complete problem in theory, so it's hard to solve in practical problems.
在理论上属于NP完全问题，在实际问题上很难解决。
The transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.
带固定费用的运输问题是一类NP难题，没有多项式算法可以求解。
Because the planning problem includes integral constrains and nonlinear constrains, it is always a NP hard problem.
此类规划问题包含有大量的整数规划及非线性约束，因而被广泛认为是一类NP难题。
Vehicle Routing problem (VRP) is a combination optimization problem in transportation logistics, which has been applied in many fields. It is a strong NP problem.
车辆路径问题是一类在物流配送调度中具有广泛应用的组合优化问题，属于强np难题。
TSP is a combinational optimization problem which has wide application background and important theory value, and it belongs to classical NP problem.
TSP问题是一个具有广泛的应用背景和重要理论价值的组合优化问题，属于典型的NP问题。
The TSP problem is considered as classical optimization grouping problem, which is widely used in practice, but it is real a difficult NP problem.
旅行商问题作为经典的组合优化问题，实际中的应用非常广泛，但它却是一个NP完全问题。
Job shop scheduling is a complex NP problem, scheduling system need considerable flexibility mechanism.
车间调度问题是一个复杂的NP问题，车间调度系统需要具有相当的柔性机制。
Timetable problem is a typical problem of combined optimization in the fields of operational research and systems engineering, which belongs to NP problem.
时间表问题是运筹学领域和系统工程领域中的典型组合优化问题，是由于事件对时间和空间的资源争夺而产生的，属于NP完全类问题。
Graph Coloring problem (GCP) is an NP hard problem.
图着色问题(GCP)是NP完全问题。
Moreover, to design a storage scheme for both memory access conflict free and network alignment conflict free is also a NP Complete problem.
另外设计同时满足存储访问无冲突和互联网络无冲突的存储方案设计问题也是一个NP完全问题。
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
Three dimension packing problem with multi constraints is a complicated combinatorial optimization, and is NP HARD problem. It is difficult to obtain on optimal solution.
多约束条件下的三维装箱问题是一个复杂的组合优化问题，属于NP-HARD问题，其求解是很困难的。
In this paper, the problem to design a conflict free access storage scheme for arbitrary templates set is proved to be a NP Complete problem.
本文证明了为任意模板集设计存储访问无冲突非线性存储方案的问题是一个NP完全问题。
Because TSP is known to be a NP - complete problem in theory, it is too difficult to be solved with traditional optimal methods.
由于TSP问题在理论上属于NP完备问题，很难用一般的算法求解。
Because TSP is known to be a NP - complete problem in theory, it is too difficult to be solved with traditional optimal methods.
由于TSP问题在理论上属于NP完备问题，很难用一般的算法求解。
应用推荐