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 条

[41] ON COMPUTATIONAL-COMPLEXITY IN DIGITAL TRANSMULTIPLEXER FILTERS
BELLANGER, MG
IEEE TRANSACTIONS ON COMMUNICATIONS, 1982, 30 (07) : 1461 - 1465
[42] COMPUTATIONAL-COMPLEXITY OF NORM-MAXIMIZATION
BODLAENDER, HL
GRITZMANN, P
KLEE, V
VANLEEUWEN, J
COMBINATORICA, 1990, 10 (02) : 203 - 225
[43] ARITHMETIC THEORIES FOR COMPUTATIONAL-COMPLEXITY PROBLEMS
HOMER, S
REIF, J
INFORMATION AND CONTROL, 1986, 69 (1-3): : 1 - 11
[44] CONSTRUCTIVITY, COMPUTABILITY, AND COMPUTATIONAL-COMPLEXITY IN ANALYSIS
WEIHRAUCH, K
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 480 - 493
[45] ON THE COMPUTATIONAL-COMPLEXITY OF THE JONES AND TUTTE POLYNOMIALS
JAEGER, F
VERTIGAN, DL
WELSH, DJA
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1990, 108 : 35 - 53
[46] ON COMPUTATIONAL-COMPLEXITY IN WEAKLY ADMISSIBLE STRUCTURES
STOLTENBERGHANSEN, V
JOURNAL OF SYMBOLIC LOGIC, 1980, 45 (02) : 353 - 358
[47] COMPUTATIONAL-COMPLEXITY OF ROOTS OF REAL FUNCTIONS
KO, KI
30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 204 - 209
[48] ON THE COMPUTATIONAL-COMPLEXITY OF ORDERED SUBGRAPH RECOGNITION
DUFFUS, D
GINN, M
RODL, V
RANDOM STRUCTURES & ALGORITHMS, 1995, 7 (03) : 223 - 268
[49] ON THE COMPUTATIONAL-COMPLEXITY OF PROGRAM SCHEME EQUIVALENCE
HUNT, HB
CONSTABLE, RL
SAHNI, S
SIAM JOURNAL ON COMPUTING, 1980, 9 (02) : 396 - 416
[50] ON THE COMPUTATIONAL-COMPLEXITY OF DISCRETE MULTIVARIATE PROBLEMS
YEMELICHEV, VA
PEREPELITSA, VA
SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1988, 26 (04): : 162 - 168

← 1 2 3 4 5 →