PEKS 系统包含有四个 多项式时间 ( Polynomial Time )的演算法如下: (i)keyGen(s): s 为安全參數,输出为公钥私钥对 A
基于348个网页-相关网页
Polynomial time algorithm 多项式时间算法
polynomial time reduction 多项式时间归约
polynomial time approximation scheme 多项式时间近似方案 ; 多项式时间近似策略
polynomial-time complexity 多项式时间复杂性
nondeterministic polynomial time 不确定性多项式时间
pseudo polynomial time 伪多项式时间
fully polynomial time approximation 全多项式时间近似
Non-deterministic Polynomial Time Complete 非确定性完全问题
polynomial-time reduction 多项式时间还元
Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.
例如 Shor 的算法能在多项式时间内找到一个 N 位函数的周期。
The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.
内点法是一种求解线性规划问题的多项式时间算法,其显著特征是其迭代次数与系统规模关系不大。
Typically up till now, we've looked at things that can be done in sublinear time. Or, at worst, polynomial time. We'll now look at a problem that does not fall into that. And we'll start with what's called the continuous knapsack problem.
至今为止我们已经处理过,亚线性问题,最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。
应用推荐