但多项式本身包含突变的可能,使得在用多项式拟合一些曲线时,会表现出大幅“尖脉冲”,对拟合精度影响很大。
But the possibility of the sudden changes contained in polynomial considerably produces "sharp pulse" when expressing some curves with polynomial, which has greatly reduced precision.
利用匹配多项式根的信息,根据其定义以及图的度序列和匹配多项式的性质推导。
Use the information of the matching roots, and the character of the degree sequence and matching polynomials to compute.
本文提出了命题多项式,0 - 1命题多项式的概念,应用它们,实现了命题函数的解析化。
In this paper, proposition polynomial and 0-1 proposition polynomial are advanced. Using them, analysis of proposition function is realized.
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.
至今为止我们已经处理过,亚线性问题,最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。
应用推荐