Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n /
| Data(s) |
21/01/1979
|
|---|---|
| Resumo |
"UILU-ENG 79 1716." Bibliography: p. 14. Mode of access: Internet. |
| Formato |
con |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Urbana : Dept. of Computer Science, University of Illinois at Urbana-Champaign, |
| Direitos |
Items in this record are available as Creative Commons Attribution-NonCommercial-ShareAlike. View access and use profile at http://www.hathitrust.org/access_use#cc-by-nc-sa-3.0. Please see individual items for rights and use statements. |
| Palavras-Chave | #Game theory #Computational complexity #Combinatorial analysis #Chess |
| Tipo |
text |
