Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N.
Aviezri S. Fraenkel
,
David Lichtenstein
Venue
A*
ICALP
Year
1981
Proceedings
ICALP
DBLP record
conf/icalp/FraenkelL81 ↗
Browse the full
ICALP paper archive
.