An algorithm with polynomial complexity was presented to generate the public part of the process from its private one.

设计了一个具有多项式时间复杂度的算法从流程私有部分自动生成相应的公开部分。

youdao

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.

利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。

youdao

Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial.

在此基础上提出了优化的知识约简算法，该算法的时间复杂度是多项式的。

youdao