| 1. | Inimum network problem and its time - based polynomial algorithm
最小网络问题及其多项式时间算法 |
| 2. | A polynomial time algorithm in positive define geometric programming with constraints
约束正定式几何规划的一种多项式时间算法 |
| 3. | A psuedo - polynomially solvable case of the loader problem in modern logistics technology
现代物流技术中装卸工问题的拟多项式时间可解情况 |
| 4. | A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs
一个求外平面图最小反馈点集的多项式时间算法 |
| 5. | Because it can " t finish in polynomial time , the scheduling problem is known to be np - hard
由于该问题不能在多项式时间内求得最优解，因而被公认为一个np完全问题。 |
| 6. | The solution method of the model is testified to be polynomial arithmetic and can fulfils real - time demand in battle
该模型的解法被证明是多项式时间算法，满足作战实时性要求。 |
| 7. | Experimental results show that aco - steiner can get a short running time and keep the high performance
Garey和johnson证明了rsmt问题是一个np - complete问题，这说明不存在多项式时间求解精确解的算法。 |
| 8. | The complexity of kf - diff is o ( nlogn ) , while n is the number of the nodes in the tree , vs . polynomial time for previous algorithms
在算法复杂度上从先前的多项式时间提高到o ( nlogn ) ，其中n为文档结点数。 |
| 9. | Without the strict feasibility of the initial points and iteration points , the algorithm is shown to possess both polynomial - time complexity and q - linear convergence
该算法不要求初始点及迭代点的可行性且具有q -线性收敛速度和多项式时间复杂性。 |
| 10. | Meanwhile , the efficiency of the new attribute algorithm is proven through the example . finally , we carry out a system based on the above algorithms
该算法使得有序决策表中的属性约简算法为多项式时间的,并且通过实例证明了该启发式算法的有效性。 |
