THE COMPLEXITY OF COMBINATORIAL PROBLEMS WITH SUCCINCT INPUT REPRESENTATION

被引：189

作者：

WAGNER, KW

机构：

来源：

关键词：

D O I：

10.1007/BF00289117

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：325 / 356

页数：32

共 32 条

[1] ON COUNTING PROBLEMS AND THE POLYNOMIAL-TIME HIERARCHY [J].

ANGLUIN, D .

[2]

Bentley J. L., 1983, ADV COMPUTING RES, P127

[3] SUCCINCT REPRESENTATIONS OF GRAPHS [J].

GALPERIN, H ;

WIGDERSON, A .

INFORMATION AND CONTROL, 1983, 56 (03) :183-198

[4]

Garey M. R., 1979, COMPUTERS INTRACTIBI

[5] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J].

GILL, J .

[6]

Hartmanis J., 1983, 24th Annual Symposium on Foundations of Computer Science, P439, DOI 10.1109/SFCS.1983.21

[7]

Ladner R. E., 1975, SIGACT News, V7, P18, DOI 10.1145/990518.990519

[8] BPP AND THE POLYNOMIAL HIERARCHY [J].

LAUTEMANN, C .

[9]

Lengauer T., 1982, 23rd Annual Symposium on Foundations of Computer Science, P358, DOI 10.1109/SFCS.1982.92

[10]

LENGAUER T, 1984, TRSFB124FB10 U SAARL