Our algorithms are of polynomial complexity.
该算法具有多项式复杂度。
The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。
An algorithm with polynomial complexity was presented to generate the public part of the process from its private one.
设计了一个具有多项式时间复杂度的算法从流程私有部分自动生成相应的公开部分。
应用推荐