基本释义:

NP 问题

网络释义

1)NP problem,NP 问题

2)NP ∩ co-NP problem,NP∩co-NP问题

3)NP problem,NP问题

4)NP-hard problem,NP-难问题

5)NP-Hard problem,NP-Hard问题

6)NP-hard,NP-难问题

7)NP problems,NP类问题

8)NP hard problem,NP-难问题

9)NP hard problem,NP难问题

10)NP-hard problem,NP难问题

用法和例句

The article main research NP problem processing when carries on the fault tree analysis.

本文主要研究在进行故障树分析(Fault Tree Analysis,FTA)时NP问题的处理。

The NP problem is a critical problem in the elliptic curve cryptosystem.

在椭圆曲线加密体制中,NP问题是制约其应用和发展的瓶颈的核心问题。

The TSP(Traveling Salesman Problem) is a NP problem which is easily described but difficult to solve.

TSP即旅行商问题或者货郎担问题是一个易于描述但难于解决的NP问题,也是一个具有广泛的应用背景和重要理论价值的组合优化问题。

Vehicle routing problem with time windows is a NP-hard problem in combinatorial optimization field.

有时间窗的车辆路径问题属于组合优化领域中的NP-hard问题。

Quadratic assignment problem is one of the classical NP-hard problems in combinatorial optimization field.

二次分配问题是组合优化领域中经典的NP-hard问题之一,应用广泛。

Course scheduling problem is a type of NP-hard problems.

排课问题是一典型NP-Hard问题,通常可以使用遗传算法进行解决,把遗传算法与局部搜索方法禁忌算法有机结合起来,是改进遗传算法性能的一个卓有成效的方法。

The authors we lodged a method of reducing the solving difficulty the creative method of nonequivalence single restrict, aim at a kind of combination and optimize problem multi dimension 0 1 knapsack problem(also called the NP hard problem).

针对一类组合优化问题—多维 0 - 1背包问题 ( MKP) ,这是一个 NP-难问题 ,提出一种能减少求解难度的方法—约束化简方法。

In complexity theory,set packing problems is an important NP-hard problem,which is used widely in the fields of scheduling and code optimization.

在复杂性理论中,此问题是一类重要的NP难问题,被广泛应用于调度、代码优化和生物信息学等领域。

The computational complexity problem of K-T point in quadratic programming is transformed into linear complementarity s computational complexity problem,and combining with knapsack problem,we obtained that quadratic programming is an NP-hard problem.

将二次规划中K-T点复杂性问题转化为线性互补复杂性问题,并结合背包问题得出二次规划是NP难问题。