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

Jean-François Baffier et al. (2017)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2017.02.024

access: closed

type: Journal Article

metadata version: 2018-11-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/BaffierCDKMRRU17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BaffierCDKMRRU17
Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno:
Hanabi is NP-hard, even for cheaters who look at their cards. Theor. Comput. Sci. 675: 43-55 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.