The computational complexity of the improved algorithm approaches polynomial complexity, much less than 2 N ( N is the vertex number of a graph).
后者的计算时间复杂性远远低于2 N（N为图的顶点数） ，已接近于多项式时间复杂性。
By using Newton direction and centering direction, we establish a feasible interior point algorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
The algorithm's complexity of calculation is polynomial in a speciftc statistic's sense.
算法在统计意义下为多项式时间复杂度。
应用推荐