你正面临一个更广义的问题分区的问题，这是非完全多项式。
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.
应用推荐