Note: Your solution should be in polynomial time complexity.

注意：你的解法应该满足多项式时间复杂度。

youdao

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

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

youdao

SAT problem belongs to the NP class, that is, theoretically it can't be solved in polynomial time and solving it exceeds the capability of modern computer.

SAT问题是NP完全问题，从理论上说，SAT问题不能在多项式时间内解决，它超出了现代计算机的能力。

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.

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

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