16 citations · 19 across the 2 of their papers we have counts for
1 paper · 1 filter
Cédric Piette, Éric Piette, Matthew Stephenson +2
Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particu…