ON THE COMPLEXITY OF ESTIMATING THE SIZE OF A TEST SET

被引：24

作者：

KRISHNAMURTHY, B ^{[1
]}

AKERS, SB ^{[1
]}

机构：

[1] GE,MIL ELECTR SYST OPERAT,SYRACUSE,NY 13221

来源：

关键词：

D O I：

10.1109/TC.1984.5009364

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：750 / 753

页数：4

共 9 条

[1] UNIVERSAL TEST SETS FOR LOGIC NETWORKS [J].

AKERS, SB .

[2] DERIVATION OF MINIMUM TEST SETS FOR UNATE LOGICAL CIRCUITS [J].

BETANCOURT, R .

[3]

Bruijin NG, 1964, APPLIED COMBINATORIA, P144

[4]

FUJIWARA H, 1981, IEEE T COMPUT, V30, P556, DOI 10.1109/TC.1981.1675840

[5]

FUJIWARA H, 1982, IEEE T COMPUT, V31, P555, DOI 10.1109/TC.1982.1676041

[6]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[7]

HAYES JP, 1973, JUN FAULT TOL COMP S, P73

[8]

IBARAKI T, 1979, T IECE JAPAN E, P81

[9] POLYNOMIALLY COMPLETE FAULT DETECTION PROBLEMS [J].

IBARRA, OH ;

SAHNI, SK .