FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY

被引：0

|

作者：

STRAUBING, H ^{[1
]}

THERIEN, D ^{[1
]}

机构：

[1] MCGILL UNIV, SCH COMP SCI, MONTREAL H3A 2A7, QUEBEC, CANADA

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 386卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：199 / 233

页数：35

相关论文

共 50 条

[21] COMPUTATIONAL-COMPLEXITY OF LOSS NETWORKS
LOUTH, G
MITZENMACHER, M
KELLY, F
THEORETICAL COMPUTER SCIENCE, 1994, 125 (01) : 45 - 59
[22] SOCIAL CHOICE AND COMPUTATIONAL-COMPLEXITY
KELLY, JS
JOURNAL OF MATHEMATICAL ECONOMICS, 1988, 17 (01) : 1 - 8
[23] THE COMPUTATIONAL-COMPLEXITY OF CONTINUED FRACTIONS
STRASSEN, V
SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 1 - 27
[24] COMPUTATIONAL-COMPLEXITY OF PERT PROBLEMS
HAGSTROM, JN
NETWORKS, 1988, 18 (02) : 139 - 147
[25] ON THE COMPUTATIONAL-COMPLEXITY OF CONTINUOUS ROUTING
CHANG, YK
HAMBRUSCH, S
SIMON, J
JOURNAL OF ALGORITHMS, 1989, 10 (01) : 86 - 108
[26] CLASSIFYING THE COMPUTATIONAL-COMPLEXITY OF PROBLEMS
STOCKMEYER, L
JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 1 - 43
[27] DESCRIPTIVE CHARACTERIZATIONS OF COMPUTATIONAL-COMPLEXITY
LEIVANT, D
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 39 (01) : 51 - 83
[28] ON THE COMPUTATIONAL-COMPLEXITY OF MODULAR SYMBOLS
GOLDFELD, D
MATHEMATICS OF COMPUTATION, 1992, 58 (198) : 807 - 814
[29] COMPUTATIONAL-COMPLEXITY ON NUMERICAL INTEGRALS
WANG, XH
HAN, DF
SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY & TECHNOLOGICAL SCIENCES, 1991, 34 (01): : 42 - 47
[30] THE COMPUTATIONAL-COMPLEXITY OF UNIVERSAL HASHING
MANSOUR, Y
NISAN, N
TIWARI, P
THEORETICAL COMPUTER SCIENCE, 1993, 107 (01) : 121 - 133

← 1 2 3 4 5 →