多项式

Meanwhile we denote that some problems doesn't possess polynomial solution.

同时指出了在一些情况下弹性力学平面问题是不具有多项式的解答。

Numerical solution for polynomial positivity validation is explored.

研究了多项式正定性验证的数值求解方法。

It has been proved that the grid job scheduling is a NP-complete problem, and it is hard to find an optimal solution in polynomial time by using traditional searching method.

已有文献证明，由于网格的复杂多变和任务的层出不穷，网格中的任务调度属于NP完全问题，很难用传统的搜索办法在多项式时间内找到最优解。

Almost all of these problems are NP-hard, it is very difficult to find a polynomial optimal solution. Hence, many people try to solve such problems through various methods to find suboptimal solutions instead.

分布式计算系统的任务调度是确定性调度问题中的一个重要专题，这类问题基本上都是NP难题，因此很难找到多项式时间最优算法。

Within algebraic geometry is the description of geometric objects as solution sets of polynomial equations, combining the concepts of quantity and space, and also the study of topological groups , which combine structure and space.

在代数几何里，把几何对象描述成多项式方程的解集，结合数量和空间的概念；也研究拓扑群，结合了结构和空间。

As an NP-hard problem, this model has no solution based on polynomial algorithm at present. Therefore, an adaptive and polymorphic ant colony algorithm has been brought forward to solve the VRPMC.

由于该模型是一个NP-hard问题，目前还没有多项式算法求解，又提出了采用自适应的多态蚁群算法来对其进行求解的策略。

After the chained conversion, the paper discussed controllable method of chained system, as a result, we applied the time polynomial inputs control solution in our manipulator.

完成链式变换后，本文研究了链式系统的控制方法，利用时间多项式输入控制的方法实现了对该多关节机械手臂的控制。

This paper presented a three-phase heuristic approach to deal with this NP-hard problem. During the process of determining the bottleneck work center, arranging the devices, and ordering the jobs, reduced the complexity of the problem gradually. Therefore obtained an effective solution within polynomial time.

针对这个NP-hard问题，提出一种三阶段启发式方法，通过依次完成瓶颈工作中心的判定、设备分配和任务排序，使这一问题的复杂度得以逐步降低，从而可以在多项式时间内得到有效的调度方案。

High degree congruence, Cryptosystem, Trivial solution, Polynomial time algorithm.

高阶同余方程，密码体制，平凡解，多项式时间算法

The observing activity featured by angle-dependent effects, sequence characteristics, so the problem can be partition into multiple phases according to the maximum slew times. The algorithm based on dynamic programming is developed to find the global optimal solution within polynomial time.

分析了观测活动性质，并基于观测活动间存在时序关系特征，将问题按照卫星的最大侧摆次数划分为多个阶段，提出了基于动态规划思想的算法，能够在多项式时间内得到问题的最优解。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失