Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.
例如 Shor的算法能在多项式时间内找到一个N位函数的周期。
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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
A polynomial time approximation scheme (PTAS) for this problem is presented.
给出了一个多项式时间近似方案(PTAS)。
The complexity of DSAFO is bounded between quadratic and cubic polynomial time.
DSAFO算法具有不错的时间复杂度：介于平方和三次方之间。
This paper presents a polynomial time algorithm for finding Rectilinear-Steiner-Trees by statistical analysis.
本文利用统计分析法，提出求解矩形斯坦纳树问题的多项式时间算法。
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.
以无基集为基础，结合最大无基集的定义，提出一个多项式时间算法。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
Basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem.
本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。
These two algorithms relax the constraints of ML algorithm and transform it into a convex problem which can be efficiently solved with a polynomial time.
这两类算法是在ML算法基础上放松约束条件，将问题转化为可在多项式时间内解决的凸优化问题。
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.
本文给出了一个新的匹配协议，该协议是语义安全的，不存在概率多项式时间算法区分对两个输入的猜测值。
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.
提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。
Polynomial time algorithms are given for some special types of connected assignment.
对某些特殊类型的分配问题，给出了多项式复杂性的分配算法。
Some numerical results for a large number of random convex quadratic programming problems show that the new algorithm is efficient and might be a polynomial-time algorithm under some conditions.
大量的关于随机的凸二次规划问题的数值实验结果表明它的计算效率是高的，在某些条件下可能是多项式时间算法。
We use network coding, i. e. , allowing intermediate nodes to code, the problem can be formulated as a linear program problem and has a polynomial-time solution.
利用网络编码，允许中间节点进行信息编码，最小能量广播问题可以转化为一个线性规划问题，并且具有一个多项式时间解。
We use network coding, i. e. , allowing intermediate nodes to code, the problem can be formulated as a linear program problem and has a polynomial-time solution.
利用网络编码，允许中间节点进行信息编码，最小能量广播问题可以转化为一个线性规划问题，并且具有一个多项式时间解。
应用推荐