GO IS POLYNOMINAL-SPACE HARD

被引：99

作者：

LICHTENSTEIN, D

SIPSER, M

机构：

来源：

关键词：

D O I：

10.1145/322186.322201

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：393 / 401

页数：9

共 10 条

[1]

BERLEKAMP ER, WINNING WAYS

[2]

BLOCK HC, 1975, SIGART NEWSLETTER AC, V51, P13

[3]

CHANDRA AK, 1973, 17TH ANN IEEE S F CO, P98

[4] COMBINATORIAL PROBLEM WHICH IS COMPLETE IN POLYNOMIAL SPACE [J].

EVEN, S ;

TARJAN, RE .

[5]

FRAENKEL A, 1978, 19TH P ANN S F COMP, P55

[6]

KARP PM, 1972, COMPLEXITY COMPUTER

[7]

LICHTENSTEIN D, 1978, UCBERLM7816 U CAL EL

[8]

LICHTENSTEIN D, UNPUBLISHED

[9]

MEYER AR, 1973, 5TH P ANN ACM S THEO, P1

[10] COMPLEXITY OF SOME 2-PERSON PERFECT-INFORMATION GAMES [J].

SCHAEFER, TJ .