COMPLEXITY OF SOME 2-PERSON PERFECT-INFORMATION GAMES

被引：146

作者：

SCHAEFER, TJ ^{[1
]}

机构：

[1] UNIV CALIF BERKELEY,DEPT MATH,BERKELEY,CA 94720

来源：

关键词：

D O I：

10.1016/0022-0000(78)90045-4

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：185 / 225

页数：41

共 15 条

[1]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[2]

BERLEKAMP ER, 1975, L R HACKENBUSH IS NP

[3]

Chandra A. K., 1976, 17TH P IEEE S F COMP, P98, DOI DOI 10.1109/SFCS.1976.4

[4]

Conway J.H., 1976, NUMBERS GAMES

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

EVEN, S ;

TARJAN, RE .

[6]

EVEN S, 1975, 7TH P ANN ACM S THEO, P66

[7]

FRAENKEL AS, 1977, COMPLEXITY PROBLEMS

[8]

Guy R.K., 1956, P CAMB PHILOS SOC, V52, P514

[9] SPACE-BOUNDED REDUCIBILITY AMONG COMBINATORIAL PROBLEMS [J].

JONES, ND .

[10]

Karp Richard M., 1972, COMPLEXITY COMPUTER, P85