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 条

[21] COMPUTATIONAL-COMPLEXITY OF MATROID PROPERTIES
ROBINSON, GC
WELSH, DJA
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1980, 87 (JAN) : 29 - 45
[22] LOGICAL SYNTAX AND COMPUTATIONAL-COMPLEXITY
DENENBERG, L
LEWIS, HR
LECTURE NOTES IN MATHEMATICS, 1984, 1104 : 101 - 115
[23] ON THE COMPUTATIONAL-COMPLEXITY OF A RIGIDITY PROBLEM
MANSFIELD, A
IMA JOURNAL OF APPLIED MATHEMATICS, 1981, 27 (04) : 423 - 429
[24] COMPUTATIONAL-COMPLEXITY OF LOSS NETWORKS
LOUTH, G
MITZENMACHER, M
KELLY, F
THEORETICAL COMPUTER SCIENCE, 1994, 125 (01) : 45 - 59
[25] SOCIAL CHOICE AND COMPUTATIONAL-COMPLEXITY
KELLY, JS
JOURNAL OF MATHEMATICAL ECONOMICS, 1988, 17 (01) : 1 - 8
[26] COMPUTATIONAL-COMPLEXITY OF ARITHMETICAL SENTENCES
TUNG, SP
INFORMATION AND COMPUTATION, 1995, 120 (02) : 315 - 325
[27] ON THE COMPUTATIONAL-COMPLEXITY OF ALGEBRA ON LATTICES
HUNT, HB
ROSENKRANTZ, DJ
BLONIARZ, PA
SIAM JOURNAL ON COMPUTING, 1987, 16 (01) : 129 - 148
[28] THE COMPUTATIONAL-COMPLEXITY OF CONTINUED FRACTIONS
STRASSEN, V
SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 1 - 27
[29] ON THE COMPUTATIONAL-COMPLEXITY OF CONTINUOUS ROUTING
CHANG, YK
HAMBRUSCH, S
SIMON, J
JOURNAL OF ALGORITHMS, 1989, 10 (01) : 86 - 108
[30] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 199 - 233

← 1 2 3 4 5 →