多项式的
adj. polynomial
网络释义
...实际上就是对应最终解的那个排列组合的某个"子排列组合"（某种子集）；而这里的“子排列组合”的数目则往往是多项式的（silwile，，指出并非总是如此），这就是为什么一个组合复杂性的穷举问题可以DP优化为多项式复杂度的问题。
基于4个网页-相关网页
双语例句原声例句
-
方法利用匹配多项式的定义和性质推导。
Methods The character and definition of matching polynomials are used to compute.
-
利用显式可以计算得到规范多项式的参数。
The parameters of canonical polynomials can be obtained by using explicit formulae.
-
随后又给出了几类插值多项式的局部近似空间。
Subsequently we present local approximation spaces of some interpolation polynomial.
-
PROFESSOR: Great question. So the question is, how do you choose an algorithm, why would I choose to use a pseudo-polynomial algorithm when I don't know how big the solution is likely to be, I think that's one way to think about it.
教授：问得好，所以问题是，你怎样选择算法，为什么当我,不知道解决方案会有多大的时候,我要选伪多项式算法呢，我想这是一种思考问题的方式。
-
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.
至今为止我们已经处理过,亚线性问题，最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。
应用推荐