Hanabi is NP-complete, even for cheaters who look at their cards

Hanabi is NP-complete, even for cheaters who look at their cards
复制标题

Hanabi 是 NP 完全的,即使对于那些看牌的作弊者来说也是如此

DOI:
--
复制
发表时间:
2017
影响因子:
1.1
通讯作者:
Yushi Uno
Yushi Uno
中科院分区:
计算机科学4区
文献类型:
--
作者:
Jean-Francois Baffier;Man-Kwun Chiu;Yago Diez;Matias Korman;Valia Mitsou;Andr´e van Renssen;Marcel Roeloffzen;Yushi Uno

文献摘要

相似文献