Lower bounds for dynamic BDD reordering
Lower bounds for dynamic BDD reordering
复制标题
动态 BDD 重新排序的下限
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
R. Drechsler
中科院分区：
文献类型：
--
作者：
Rüdiger Ebendt;R. Drechsler
在本文中，我们提出了新的下界BDD大小。这些下界是从最近在精确BDD最小化的上下文中给出的更一般的下界导出的。本文提出的结果是双重的：首先，我们通过研究新的下限背后的理论获得了更深入的了解。例子导致一个更好的理解，表明新的下限是有效的情况下，这不是以前的下限的情况下，反之亦然。在实践中的约束，然后我们之间的妥协运行时间和质量的下限。最后，新旧下界的巧妙组合会产生最终下界，从而产生显著的改进。实验结果表明了我们方法的有效性。
In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimization. The results presented in this paper are twofold: first, we gain deeper insight by looking at the theory behind the new lower bounds. Examples lead to a better understanding, showing that the new lower bounds are effective in situations where this is not the case for previous lower bounds and vice versa. Following the constraints in practice, we then compromise between runtime and quality of the lower bounds. Finally, a clever combination of old and new lower bounds results in a final lower bound, yielding a significant improvement. Experimental results show the efficiency of our approach.