書誌事項
- 公開日
- 1994-01
- 権利情報
-
- https://www.elsevier.com/tdm/userlicense/1.0/
- https://www.elsevier.com/open-access/userlicense/1.0/
- DOI
-
- 10.1016/0304-3975(94)90131-7
- 公開者
- Elsevier BV
この論文をさがす
説明
AbstractGiven an arbitrary position of the Othello game played on an n × n board, the problem of determining the winner is shown to be PSPACE-complete. It can be reduced from generalized geography played on bipartite graphs with maximum degree 3.
収録刊行物
-
- Theoretical Computer Science
-
Theoretical Computer Science 123 (2), 329-340, 1994-01
Elsevier BV
