| 1. | This is analogous to the np complete problem
这与np完全问题是类似的。 |
| 2. | But , in fact , it is even worse than that
但是，实际上，这种穷举测试比np完全问题更糟糕。 |
| 3. | And the decision problems corresponding to those are np ? complete or np ? hard
而其相应的判定问题是np完全问题或np困难问题 |
| 4. | Some people assert that genetic algorithm has tended to np - had problem
有专家断言遗传算法是用来解决np完全问题和np难题的趋势。 |
| 5. | 2 . a more brief proof about the np - competeness of these algorithm is provided
2 .给出了面积优化算法的np完全性更为简洁的证明。 |
| 6. | Because it can " t finish in polynomial time , the scheduling problem is known to be np - hard
由于该问题不能在多项式时间内求得最优解，因而被公认为一个np完全问题。 |
| 7. | Timetabling problem ( tp ) is a multiobjective combination optimization problem with constraints , and also has been proved np - completed
排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个np完全问题。 |
| 8. | The complexity theory of calculation has proved that the so - called problem of np and other similar problems are equal in calculating
计算复杂性理论表明，被称作np完全问题的旅行推销员问题以及其它类似的组合优化问题在计算上是等价的。 |
| 9. | Three - dimensional component packing is a combinatorial optimization and np - complete problem . it is difficult to find its exact global optimum
三维布局问题属于组合最优化问题和np完全问题，在一定时间内求其精确全局最优解是相当困难的。 |
| 10. | Due to the np - completeness of optimal msa , any attempt of developing a fast algorithm to compute optimal multiple sequence alignments is expected to fail
由于序列对齐是一个np完全问题，所有企图快速产生最优化对齐的想法是不可能实现的。 |
