A NOTE ON THE COMPUTATIONAL-COMPLEXITY OF BRACKETING AND RELATED PROBLEMS

被引：0

|

作者：

KRIVANEK, M

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 381卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：136 / 145

页数：10

相关论文

共 50 条

[1] COMPUTATIONAL-COMPLEXITY OF PERT PROBLEMS
HAGSTROM, JN
[J]. NETWORKS, 1988, 18 (02) : 139 - 147
[2] CLASSIFYING THE COMPUTATIONAL-COMPLEXITY OF PROBLEMS
STOCKMEYER, L
[J]. JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 1 - 43
[3] ON THE COMPUTATIONAL-COMPLEXITY OF PATH COVER PROBLEMS
NTAFOS, S
GONZALEZ, T
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 29 (02) : 225 - 242
[4] ARITHMETIC THEORIES FOR COMPUTATIONAL-COMPLEXITY PROBLEMS
HOMER, S
REIF, J
[J]. INFORMATION AND CONTROL, 1986, 69 (1-3): : 1 - 11
[5] ON THE COMPUTATIONAL-COMPLEXITY OF DISCRETE MULTIVARIATE PROBLEMS
YEMELICHEV, VA
PEREPELITSA, VA
[J]. SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1988, 26 (04): : 162 - 168
[6] COMPUTATIONAL-COMPLEXITY OF ART GALLERY PROBLEMS
LEE, DT
LIN, AK
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (02) : 276 - 282
[7] A NOTE ON THE COMPUTATIONAL-COMPLEXITY OF HIGH CORRELATION ESTIMATORS
GIUNTA, G
[J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1991, 39 (02) : 485 - 486
[8] A NOTE ON THE COMPUTATIONAL-COMPLEXITY OF THE ARITHMETIC FOURIER-TRANSFORM
TUFTS, DW
[J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1989, 37 (07): : 1147 - 1148
[9] A NOTE ON THE COMPUTATIONAL-COMPLEXITY OF THE PURE CLASSICAL IMPLICATION CALCULUS
STALMARCK, G
[J]. INFORMATION PROCESSING LETTERS, 1989, 31 (06) : 277 - 278
[10] AN AXIOMATIC APPROACH TO LOWER BOUND PROBLEMS IN COMPUTATIONAL-COMPLEXITY
BELAGA, EG
[J]. JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 307 - 307

← 1 2 3 4 5 →