"Hanabi is NP-complete, Even for Cheaters who Look at Their Cards."

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

> Home

Details and statistics

DOI: 10.4230/LIPICS.FUN.2016.4

access: open

type: Conference or Workshop Paper

metadata version: 2025-12-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fun/BaffierCDKMRRU16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fun/BaffierCDKMRRU16
Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno:
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. FUN 2016: 4:1-4:17

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.