THEORY OF ANNIHILATION GAMES .1.

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] Banerji R. B., 1971, P S COMP AUT, P337

[3] Berge C., 1976, GRAPHS HYPERGRAPHS

[4] COMBINATORIAL PROBLEM WHICH IS COMPLETE IN POLYNOMIAL SPACE [J]. JOURNAL OF THE ACM, 1976, 23 (04) : 710 - 719

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

[6] Fraenkel A. S., 1978, MATH MAG, V51, P13

[7] Fraenkel A. S., 1974, P S APPL MATH, V20, P87

[8] COMPUTING A PERFECT STRATEGY FOR NXN CHESS REQUIRES TIME EXPONENTIAL IN N [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1981, 31 (02) : 199 - 214

[9] THEORY OF ANNIHILATION GAMES [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 82 (05) : 775 - 777

[10] COMPLEXITY OF PROBLEMS IN GAMES, GRAPHS AND ALGEBRAIC EQUATIONS [J]. DISCRETE APPLIED MATHEMATICS, 1979, 1 (1-2) : 15 - 30

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] Banerji R. B., 1971, P S COMP AUT, P337

[3] Berge C., 1976, GRAPHS HYPERGRAPHS

[4] COMBINATORIAL PROBLEM WHICH IS COMPLETE IN POLYNOMIAL SPACE [J]. JOURNAL OF THE ACM, 1976, 23 (04) : 710 - 719

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

[6] Fraenkel A. S., 1978, MATH MAG, V51, P13

[7] Fraenkel A. S., 1974, P S APPL MATH, V20, P87

[8] COMPUTING A PERFECT STRATEGY FOR NXN CHESS REQUIRES TIME EXPONENTIAL IN N [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1981, 31 (02) : 199 - 214

[9] THEORY OF ANNIHILATION GAMES [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 82 (05) : 775 - 777

[10] COMPLEXITY OF PROBLEMS IN GAMES, GRAPHS AND ALGEBRAIC EQUATIONS [J]. DISCRETE APPLIED MATHEMATICS, 1979, 1 (1-2) : 15 - 30