Hanabi is NP-complete, even for cheaters who look at their cards
オープンアクセス
-
- 宇野 裕之
- 大阪公立大学
書誌事項
- タイトル
- Hanabi is NP-complete, even for cheaters who look at their cards
- 著者
- Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, Andr´e van Renssen, Marcel Roeloffzen, Yushi Uno
収録刊行物
-
- Theoretical Computer Science
-
Theoretical Computer Science 675 43-55, 2017