然后由债务信度网络构造了容量费用网络,利用最小费用循环流问题给出了该模型的一个多项式算法。
Then we construct a capacity cost network from the debt credit degree network. Finally, by applying minimum cost circulation flow problem, we give a polynomial algorithm for this model.
最后,在分块反对称反循环矩阵性质的基础上,给出了其特征值和特征多项式以及相似对角阵。
Finally, based on these characteristics, the eigenvalues and eigenvalues polynomials and its diagonal matrix were given.
给定一个循环码,求取它的覆盖多项式集合目前尚无系统的方法。
For a cyclic code, it is difficult to find the set of it's covering polynomials. We have not had a systematic method to find it.
应用推荐