CLASSIFYING THE COMPUTATIONAL-COMPLEXITY OF PROBLEMS

被引：34

|

作者：

STOCKMEYER, L

机构：

来源：

JOURNAL OF SYMBOLIC LOGIC | 1987年 / 52卷 / 01期

关键词：

D O I：

10.2307/2273858

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：1 / 43

页数：43

相关论文

共 50 条

[1] COMPUTATIONAL-COMPLEXITY OF PERT PROBLEMS
HAGSTROM, JN
[J]. NETWORKS, 1988, 18 (02) : 139 - 147
[2] ARITHMETIC THEORIES FOR COMPUTATIONAL-COMPLEXITY PROBLEMS
HOMER, S
REIF, J
[J]. INFORMATION AND CONTROL, 1986, 69 (1-3): : 1 - 11
[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] 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
[5] COMPUTATIONAL-COMPLEXITY OF ART GALLERY PROBLEMS
LEE, DT
LIN, AK
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (02) : 276 - 282
[6] A NOTE ON THE COMPUTATIONAL-COMPLEXITY OF BRACKETING AND RELATED PROBLEMS
KRIVANEK, M
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 381 : 136 - 145
[7] AN AXIOMATIC APPROACH TO LOWER BOUND PROBLEMS IN COMPUTATIONAL-COMPLEXITY
BELAGA, EG
[J]. JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 307 - 307
[8] THE COMPUTATIONAL-COMPLEXITY OF SIMULTANEOUS DIOPHANTINE APPROXIMATION-PROBLEMS
LAGARIAS, JC
[J]. SIAM JOURNAL ON COMPUTING, 1985, 14 (01) : 196 - 209
[9] COMPUTATIONAL-COMPLEXITY OF DISTRIBUTED DETECTION PROBLEMS WITH INFORMATION CONSTRAINTS
RAO, NSV
IYENGAR, SS
KASHYAP, RL
[J]. COMPUTERS & ELECTRICAL ENGINEERING, 1993, 19 (06) : 445 - 451
[10] COMPUTATIONAL-COMPLEXITY OF PROBLEMS OF OPTIMAL REDISTRIBUTION OF INDIVISIBLE RESOURCES
SOTNIKOV, YA
[J]. SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1990, 28 (01): : 121 - 127

← 1 2 3 4 5 →