ON THE OBDD-REPRESENTATION OF GENERAL BOOLEAN FUNCTIONS

被引：60
|
作者：
LIAW, HT
LIN, CS
机构：
[1] Department of Electrical Engineering, National Taiwan University, Taipei
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1992年 / 41卷 / 06期
关键词：
BINARY DECISION DIAGRAM; BOOLEAN FUNCTION; REDUCTION RULES; SIZE COMPLEXITY; VARIABLE ORDERING;
D O I：
10.1109/12.144618
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The behavior of OBDD's [1] for general Boolean functions is studied in this paper. A tight upper bound (2n/n)(2+ epsilon) for the worst case OBDD size is presented. Although the size of an OBDD is dependent on the ordering of decision variables, it is shown that almost all functions are not sensitive to variable ordering.
引用
收藏
页码：661 / 664
页数：4
相关论文
共 50 条
12345