Polynomial time algorithm的意思|示意
多项式时间算法
Polynomial time algorithm的网络常见释义
多项式时间算法 多项式时间算法(polynomial time algorithm):可用多项式来对其计算时间限界的算法。以下六种计算时间的多项式时间算法是最为常见的
Polynomial time algorithm相关短语
1、 non polynomial time algorithm 非多项式时间算法
2、 pseudo polynomial time algorithm 伪多项式时间算法
3、 pseudo-polynomial time algorithm 拟多项式时间算法
Polynomial time algorithm相关例句
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.
大量的关于随机的凸二次规划问题的数值实验结果表明它的计算效率是高的，在某些条件下可能是多项式时间算法。
A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
Based on the definitions of the unfounded set and the greatest unfounded set, it proposes a polynomial time algorithm.
以无基集为基础，结合最大无基集的定义，提出一个多项式时间算法。
Finally, a polynomial time algorithm for solving an optimal cover of FD set is given.
最后给出了一个求f D集最优覆盖的多项式时间算法。
Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial.
在此基础上提出了优化的知识约简算法，该算法的时间复杂度是多项式的。
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.
要求容量尽可能地大，而费用尽可能地小，并就此问题提出了一个有效的多项式算法。