ON THE COMPLEXITY OF ANALYSIS AND MANIPULATION OF BOOLEAN FUNCTIONS IN TERMS OF DECISION GRAPHS

被引：4

作者：

GERGOV, J ^{[1
]}

MEINEL, C ^{[1
]}

机构：

[1] UNIV TRIER,FACHBEREICH INFORMAT 4,D-54286 TRIER,GERMANY

来源：

关键词：

DATA STRUCTURES; COMPUTATIONAL COMPLEXITY; BOOLEAN MANIPULATION; CA CIRCUIT DESIGN;

D O I：

10.1016/0020-0190(94)00048-4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：317 / 322

页数：6

共 16 条

[1]

AKERS SB, 1978, IEEE T COMPUT, V27, P509, DOI 10.1109/TC.1978.1675141

[2]

BERN J, IN PRESS P EDAC 94

BLUM, M ;

CHANDRA, AK ;

WEGMAN, MN .

[4]

BREITBART Y, 1991, UNPUB SIZE BINARY DE

[5]

BRYANT RE, 1986, IEEE T COMPUT, V35, P677, DOI 10.1109/TC.1986.1676819

[6]

Burch J. R., 1990, 27th ACM/IEEE Design Automation Conference. Proceedings 1990 (Cat. No.90CH2894-4), P46, DOI 10.1109/DAC.1990.114827

[7]

COUDERT O, 1990, P COMPUTER AIDED VER, P75

[8]

FORTUNE S, 1978, LECTURE NOTES COMPUT, V62, P227

[9]

Garey M.R., 1979, COMPUTERS INTRACTABI, V174

[10]

GERGOV J, IN PRESS IEEE T COMP