1·We provide a polynomial time algorithm to solve the problem.
给出了多项式时间的最优算法。
2·Note: Your solution should be in polynomial time complexity.
注意：你的解法应该满足多项式时间复杂度。
3·A polynomial time approximation scheme (PTAS) for this problem is presented.
给出了一个多项式时间近似方案(PTAS)。
4·The complexity of DSAFO is bounded between quadratic and cubic polynomial time.
DSAFO算法具有不错的时间复杂度：介于平方和三次方之间。
5·Polynomial time algorithms are given for some special types of connected assignment.
对某些特殊类型的分配问题，给出了多项式复杂性的分配算法。
6·Finally, a polynomial time algorithm for solving an optimal cover of FD set is given.
最后给出了一个求f D集最优覆盖的多项式时间算法。
7·Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.
例如 Shor 的算法能在多项式时间内找到一个 N 位函数的周期。
8·A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
9·This paper presents a polynomial time algorithm for finding Rectilinear-Steiner-Trees by statistical analysis.
本文利用统计分析法，提出求解矩形斯坦纳树问题的多项式时间算法。
10·Both theoretic analyses and testing results show that the new method is a deterministic polynomial time algorithm.
理论分析与实验结果表明该方法是确定性的多项式时间算法。