本算法属多项式算法，计算简单，易于计算机实现。
The Implementation of the Grover Algorithm in One-Way Quantum Computing Model;
文中同时给出了在强弦图上求最大导出森林的多项式算法。
A polynomial algorithm to find the maximum induced forest of a strongly chordal graph is given.
算法的实现难易程度由动态规划算法到多项式算法依次提高。
The degree of difficulty in algorithms is gradually enhanced in proper order from dynamic programming to continue fraction algorithm.
设计了求双线区段旅客列车扣除系数和区段通过能力的多项式算法。
The models and its polynomial algorithms are given for determining the deducting coefficient of passenger train at the various states.
带固定费用的运输问题是一类NP难题，没有多项式算法可以求解。
The transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.
本文利用最短路算法修订了图上作业法，得到了两个拟多项式算法。
In this paper, we revise the graphical method by means of the Shortest path algorithm, and obtain two variants which are pseudo-polynomial algorithms.
研究了基于翻转和删除形式的染色体完美重组问题，并给出了多项式算法。
The problem of perfect sorting by reversals and deletions was considered, and one kind of polynomial algorithm was given.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
In this paper, we consider a special integer bottleneck problem, and present two polynomial algorithms.
图的割宽问题在一般情形下，是NP难的，但对于树的情形有多项式算法。
The cutwidth problem is known that the problem for general graphs is NP hard while it is polynomially solvable for trees.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.
对计算有限域上切比雪夫多项式的特征多项式算法进行改进以提高算法的执行速度。
A Characteristic polynomial algorithm for computation of Chebyshev polynomial over finite field is modified to achieve faster execution speed.
要求容量尽可能地大，而费用尽可能地小，并就此问题提出了一个有效的多项式算法。
The capacities are required to be as large as possible, while the costs are needed to be as low as possible. To solve this problem, the authors present an efficient polynomial-time algorithm.
然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。
Then we construct a capacity cost network from the debt credit degree network. Finally, by applying minimum cost circulation flow problem, we give a polynomial algorithm for this model.
它在理论上是多项式算法，并可以从任意点启动，可以应用共轭梯度方法有效地求解大规模线性不等式组问题。
SDNM is a polynomial time algorithm with the Newtons method, so that SDNM can solve large-scale linear inequalities.
本文研究了无容量限制的带固定费用和可变费用的单物资和二物资的最小费用流问题，并分别给出了多项式算法。
We study uncapacitated version of the minimum cost flow problem of one-commodity and two-commodity with not only fixed cost but also variable cost, and give them each a polynomial algorithm.
提出一种使用定性因果与多项式算法的模型诊断方法，此方法可以明显地减少诊断的计算量，并且对这种新算法的正确性给予了证明。
In the paper, a model based diagnosis using qualitative causal model and polynomial algorithm is presented, which has less computation burden and the correctness of this new algorithm is proved.
例如 Shor的算法能在多项式时间内找到一个N位函数的周期。
Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.
为了提高网格简化后的三角形质量，提出了一种新的基于顶点局部多项式曲面拟合的三角网格简化算法。
To enhance the triangle quality of the simplified mesh, a novel triangular mesh simplification algorithm based on local polynomial fitting surface of vertices was proposed.
利用这一公式建立了常微分方程初值问题的正交多项式拟合算法。
By using this formula, orthogonal polynomial fitting algorithm for initial value problems of ordinary differential equations is established.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
本文从代数及组合两个方面论证了NP完全问题存在多项式时间算法。
In this paper, the polynimial time algorithms of the NP complete problems are gained in the algebraical and combinatorial two aspects respectively.
本文给出了一个新的匹配协议，该协议是语义安全的，不存在概率多项式时间算法区分对两个输入的猜测值。
In this paper, we present a new match protocol. It is of semantic security: there exists no probabilistic polynomial time algorithm to distinguish two guessed inputs.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.
文中在不同的条件下对它们给出了多项式时间算法。
Some polynomial algorithms are developed for them under different conditions.
旨在为吸取AES算法的精华、进一步推广使用有关多项式的算法提供参考和给予启迪。
This paper aimed to absorb the quintessence of the AES algorithm and further spread and apply the algorithms about polynomials.
本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。
Basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem.
该算法利用这组新的递推关系，提出了分别适用于对称和反对称多项式的算法。
By using these new recursive relations, we establish the new algorithm in the form of both symmetric and antisymmetric polynomials.
最后，基于此定理，给出了选址问题的一个多项式2近似算法。
Finally, based on the theorem, a polynomial 2 approximation algorithm for the location problem is presented.
理论分析与实验结果表明该方法是确定性的多项式时间算法。
Both theoretic analyses and testing results show that the new method is a deterministic polynomial time algorithm.
以无基集为基础，结合最大无基集的定义，提出一个多项式时间算法。
Based on the definitions of the unfounded set and the greatest unfounded set, it proposes a polynomial time algorithm.
应用推荐