论文部分内容阅读
本文讨论了[5]中提出的将LBLR(K)优化方法推广到信息树无限的情况时算法的性质以及应用该算法后所得结果对分析过程的影响。指出算法的复杂性是指数阶的,因此,使用该算法来实现LBLR(K)优化是不可行的。
This paper discusses the properties of the algorithm proposed in [5] when the LBLR (K) optimization method is extended to the infinity of the information tree, and the impact of the results obtained by the algorithm on the analysis process. It is pointed out that the complexity of the algorithm is exponential. Therefore, using this algorithm to implement LBLR (K) optimization is not feasible.