Polynomial time algorithm 多项式时间算法
non polynomial time algorithm 非多项式时间算法
pseudo polynomial time algorithm 伪多项式时间算法
pseudo-polynomial time algorithm 拟多项式时间算法
probabilistic polynomial time algorithm 多项式时间概率算法
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.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
In this paper, we present a new match protocol. It is of semantic security: there exists no probabilistic polynomial time algorithm to distinguish two guessed inputs.
本文给出了一个新的匹配协议，该协议是语义安全的，不存在概率多项式时间算法区分对两个输入的猜测值。
应用推荐