polynomial algorithm的例句大全

The symbolic algorithm on the solutions of the polynomial differential equations in the complex plane

复平面上微分方程多项式解的符号算法

The transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.

带固定费用的运输问题是一类NP难题，没有多项式算法可以求解。

Four special capacity expansion problem of undirected network were discussed and the responsible strongly polynomial algorithm was get.

讨论了无向网络容量扩充的4种特殊问题，给出了相应的强多项式算法。

A Polynomial Time Algorithm for Solving the Shortest Circuit of China Traveling Salesman Problem

寻求中国货郎担问题最短回路的多项式时间算法

For the parsimony this paper presents model a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.

提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。

The analysis indicates that the complexity of proposed optimal resource allocation algorithm ( ORA) is only a polynomial function of subcarriers and relay nodes number.

分析表明，所提的最优资源分配算法复杂度仅与子载波数目和中继数目成多项式关系。

This paper gives the characterization of two-variable linear optimal approximation of strict convex functions in C~ 2 ( D), find the exchange algorithm of the polynomial of two-variable linear optimal approximation, and prove the convergence of this algorithm.

本文给出C~2（D）中严格凸函数二元一次最佳逼近的特征、求二元一次最佳逼近多项式的交换算法并证明该算法的收敛性。

The monotonicity of KNA algorithm for a polynomial with only simple zeroes

算法简单易行。单零点多项式KNA算法的单调性

Vector piecewise polynomial ( VPP) approximation algorithm is proposed for environment compensation of speech signals degraded by both additive and convolutive noises.

为了统一地补偿电话语音受加性噪声和卷积通道响应的影响，本文提出了矢量分段多项式近似（VPP）算法。

In 1947, Danzig presented the conception of linear programming and the famous simplex algorithm. Although the simplex method is efficient in practical application, it is not the polynomial time algorithm and has the lower calculation efficiency in theory.

1947年，Danzig提出了线性规划及其著名的算法&单纯形算法，该算法具有很好的实际计算性能，但从复杂性理论上来说并不是一个好算法；

AKS algorithm was proposed by three computer scientists in India in Aug 2002.This algorithm can unconditionally determine whether an input number is a prime in polynomial time.

AKS算法是3位印度的计算机科学家于2002年8月提出的，它是一个能在输入规模的多项式时间内确定的对一个数进行素性测试的方法。

A polynomial approximation algorithm is proposed in this paper with its worst-case performance ratio R ∞≤ 2 75.

本文提出一个多项式近似算法，其渐近性能比R∞≤2－75。