Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Aviezri S. Fraenkel, David Lichtenstein. Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. In Shimon Even, Oded Kariv, editors, Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings. Volume 115 of Lecture Notes in Computer Science, pages 278-293, Springer, 1981.

This author has not been identified. Look up 'Aviezri S. Fraenkel' in GoogleThis author has not been identified. Look up 'David Lichtenstein' in Google

runs on WebDSL