利用匹配多项式根的信息，根据其定义以及图的度序列和匹配多项式的性质推导。
Use the information of the matching roots, and the character of the degree sequence and matching polynomials to compute.
提出了一种基于条件信息熵的知识约简启发式算法，并指出该算法的时间复杂度是多项式的。
A heuristic algorithm based on conditional information entropy for knowledge reduction is proposed, and the complexity of this algorithm is analyzed.
利用网络编码，允许中间节点进行信息编码，最小能量广播问题可以转化为一个线性规划问题，并且具有一个多项式时间解。
We use network coding, i. e. , allowing intermediate nodes to code, the problem can be formulated as a linear program problem and has a polynomial-time solution.
应用推荐