youdao

A polynomial time approximation scheme (PTAS) for this problem is presented.

给出了一个多项式时间近似方案(PTAS)。

youdao

Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.

例如 Shor 的算法能在多项式时间内找到一个 N 位函数的周期。

youdao

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.

至今为止我们已经处理过,亚线性问题，最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。

麻省理工公开课 - 计算机科学及编程导论课程节选