COMPUTATIONAL-COMPLEXITY OF TEST-GENERATION FOR ETG PLAS

被引：0

|

作者：

MIN, YH ^{[1
]}

MALAIYA, YK ^{[1
]}

GUPTA, B ^{[1
]}

机构：

[1] SO ILLINOIS UNIV,DEPT COMP SCI,CARBONDALE,IL 62901

来源：

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES | 1989年 / 136卷 / 02期

关键词：

D O I：

10.1049/ip-e.1989.0016

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：107 / 111

页数：5

相关论文

共 50 条

[21] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 199 - 233
[22] ON THE COMPUTATIONAL-COMPLEXITY OF CONTINUOUS ROUTING
CHANG, YK
HAMBRUSCH, S
SIMON, J
JOURNAL OF ALGORITHMS, 1989, 10 (01) : 86 - 108
[23] CLASSIFYING THE COMPUTATIONAL-COMPLEXITY OF PROBLEMS
STOCKMEYER, L
JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 1 - 43
[24] DESCRIPTIVE CHARACTERIZATIONS OF COMPUTATIONAL-COMPLEXITY
LEIVANT, D
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 39 (01) : 51 - 83
[25] ON THE COMPUTATIONAL-COMPLEXITY OF MODULAR SYMBOLS
GOLDFELD, D
MATHEMATICS OF COMPUTATION, 1992, 58 (198) : 807 - 814
[26] FAULT-DETECTION CAPABILITY OF AN O(M.N) TEST-GENERATION ALGORITHM FOR PLAS
MIN, YH
FUJIWARA, H
IEICE TRANSACTIONS ON COMMUNICATIONS ELECTRONICS INFORMATION AND SYSTEMS, 1991, 74 (10): : 3506 - 3512
[27] COMPUTATIONAL-COMPLEXITY .5.
KELLY, JS
SOCIAL CHOICE AND WELFARE, 1988, 5 (04) : 313 - 317
[28] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 386 : 199 - 233
[29] THE COMPUTATIONAL-COMPLEXITY OF UNIVERSAL HASHING
MANSOUR, Y
NISAN, N
TIWARI, P
THEORETICAL COMPUTER SCIENCE, 1993, 107 (01) : 121 - 133
[30] ESTIMATION OF THE GRADIENT COMPUTATIONAL-COMPLEXITY
KIM, KV
NESTEROV, IE
CHERKASSKII, BV
DOKLADY AKADEMII NAUK SSSR, 1984, 275 (06): : 1306 - 1309

← 1 2 3 4 5 →