POLYNOMIAL SPACE COUNTING PROBLEMS

被引：38

作者：

LADNER, RE

机构：

来源：

关键词：

D O I：

10.1137/0218073

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1087 / 1097

页数：11

共 12 条

[1]

Baker T., 1975, SIAM Journal on Computing, V4, P431, DOI 10.1137/0204037

[2]

Baker T. P., 1979, Theoretical Computer Science, V8, P177, DOI 10.1016/0304-3975(79)90043-4

[3] RELATING TIME AND SPACE TO SIZE AND DEPTH [J].

BORODIN, A .

[4] ALTERNATION [J].

CHANDRA, AK ;

KOZEN, DC ;

STOCKMEYER, LJ .

[5]

Karp R. M., 1972, COMPLEXITY COMPUTER, P85

[6]

SAVAGE JE, 1976, COMPLEXITY COMPUTING

[7] ON APPROXIMATION ALGORITHMS FOR =P [J].

STOCKMEYER, L .

[8]

Stockmeyer Larry, 1977, THEORET COMPUT SCI, V3, P1

[9]

Stockmeyer LJ, 1973, 5TH P ANN ACM S THEO, P1, DOI DOI 10.1145/800125.804029

[10]

Valiant L. G., 1979, Theoretical Computer Science, V8, P189, DOI 10.1016/0304-3975(79)90044-6