你正面临一个更广义的问题分区的问题，这是非完全多项式。
You are facing a more generalized problem of the Partition problem, which is NP-Complete.
本文从代数及组合两个方面论证了NP完全问题存在多项式时间算法。
In this paper, the polynimial time algorithms of the NP complete problems are gained in the algebraical and combinatorial two aspects respectively.
SAT问题是NP完全问题，从理论上说，SAT问题不能在多项式时间内解决，它超出了现代计算机的能力。
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.
文章讨论了建立在完全图基上的色多项式的若干性质。并利用完全图基讨论了一些多边图的色性。
In this paper, some properties regarding the chromatic polynomials of graph on the complete-graph-basis and the chromaticity of some graphs by complete-graph - basis are discussed.
无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。
No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
本文给出了多项式时间规约证明了在一般图上该问题是一个困难问题，即是NP完全的。
In this paper, we prove this problem to be a difficult problem that is NP complete through a polynomial reduction.
因此以一种新的方法，即利用多项式代数理论设计出能完全跟踪目标值的有限签定时间伺服系统。
This paper USES multinomial algebra theory to design the smallest finite time servo system. It can completely follow in the wake of command.
本文证明了球面有限点集的伪对称性可以完全由其特征多项式的根来刻画，并得到了在度量加运算下伪对称性具有封闭性。
In this paper, we show that the Pseudo-Symmetric property of spherical point set can be characterized by the eigen values of eigenpolynomial and it has the closeness under the metric sum operation.
详细介绍了用解析解法和数值解法(即矩阵方程的多项式解法)分别求出了基元回路为正方形的“田”字形超导网络在外磁场中的临界温度，结果表明两种计算方法是完全等价的。
The critical temperature of superconducting network which is composed of square unit loops in external magnetic field is solved by means of analytic method and numeric method I.
本文利用刘彦佩提出的嵌入的联树模型，得出了两类新的四正则图的完全亏格多项式，并推导出已有结果的两类图的完全亏格多项式。
In this paper, We obtain the total genus polynomials for two new classes of 4-regular graphs by using the joint tree model of a graph embedding introduced by Yanpei Liu.
公式表明，不完全双二次多项式的DEM传递误差与双线性多项式的传递误差相同。
The formula shows that the propagation error from biquadratic polynomial is the same as the error from linear polynomial.
公式表明，不完全双二次多项式的DEM传递误差与双线性多项式的传递误差相同。
The formula shows that the propagation error from biquadratic polynomial is the same as the error from linear polynomial.
应用推荐