Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/tcs/BaffierCDKMRRU17
%A Baffier, Jean-François
%A Chiu, Man-Kwun
%A Diez, Yago
%A Korman, Matias
%A Mitsou, Valia
%A van Renssen, André
%A Roeloffzen, Marcel
%A Uno, Yushi
%D 2017
%J Theor. Comput. Sci.
%K dblp
%P 43-55
%T Hanabi is NP-hard, even for cheaters who look at their cards.
%U http://dblp.uni-trier.de/db/journals/tcs/tcs675.html#BaffierCDKMRRU17
%V 675
@article{journals/tcs/BaffierCDKMRRU17,
added-at = {2018-11-30T00:00:00.000+0100},
author = {Baffier, Jean-François and Chiu, Man-Kwun and Diez, Yago and Korman, Matias and Mitsou, Valia and van Renssen, André and Roeloffzen, Marcel and Uno, Yushi},
biburl = {https://www.bibsonomy.org/bibtex/295d27fce4e83d548bbdd396edf167618/dblp},
ee = {https://doi.org/10.1016/j.tcs.2017.02.024},
interhash = {f9019efbcb26a845ec422f937ff381e9},
intrahash = {95d27fce4e83d548bbdd396edf167618},
journal = {Theor. Comput. Sci.},
keywords = {dblp},
pages = {43-55},
timestamp = {2018-12-01T12:44:39.000+0100},
title = {Hanabi is NP-hard, even for cheaters who look at their cards.},
url = {http://dblp.uni-trier.de/db/journals/tcs/tcs675.html#BaffierCDKMRRU17},
volume = 675,
year = 2017
}