Inimum network problem and its time - based polynomial algorithm 最小网络问题及其多项式时间算法
2.
A polynomial time algorithm in positive define geometric programming with constraints 约束正定式几何规划的一种多项式时间算法
3.
A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs 一个求外平面图最小反馈点集的多项式时间算法
4.
The solution method of the model is testified to be polynomial arithmetic and can fulfils real - time demand in battle 该模型的解法被证明是多项式时间算法，满足作战实时性要求。
5.
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 摘要本文对线性规划提出了一个不可行内点原始对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
