Minimization of symbolic relations
Minimization of symbolic relations
复制标题
符号关系最小化
DOI：
10.1109/iccad.1990.129848
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
F. Somenzi
中科院分区：
文献类型：
--
作者：
Bill Lin;F. Somenzi
解决了最小化符号关系的问题。通过示例说明了该问题在最优编码领域的相关性。给出了所涉及的优化问题的二元覆盖公式，其中有几种算法可用。提出了一种基于二元决策图（BDD）的新颖方法，作者展示了在这种情况下如何在线性时间内解决覆盖问题。<<ETX>>
The problem of minimizing symbolic relations is addressed. The relevance of this problem in the field of optimal encoding is shown by examples. A binate covering formulation of the optimization problems involved is given, for which several algorithms are available. A novel method is proposed which is based on binary decision diagrams (BDDs) and the authors show how the covering problem can be solved in linear time in that case.<<ETX>>