Hanabi is NP-hard, even for cheaters who look at their...

Theoretical Computer Science 2017 / 05 Vol. 675

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

Baffier, Jean-François, Chiu, Man-Kwun, Diez, Yago, Korman, Matias, Mitsou, Valia, van Renssen, André, Roeloffzen, Marcel, Uno, Yushi
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
675
Language:
english
Journal:
Theoretical Computer Science
DOI:
10.1016/j.tcs.2017.02.024
Date:
May, 2017
File:
PDF, 383 KB
english, 2017
Conversion to is in progress
Conversion to is failed