The fewest clues problem
When analyzing the computational complexity of well-known puzzles, most papers consider the algorithmic challenge of solving a given instance of (a generalized form of) the puzzle. We take a different approach by analyzing the computational complexity of designing a "good" puzzle. We assum...
| Main Authors: | , , , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | en_US |
| 出版: |
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
2017
|
| 在線閱讀: | http://hdl.handle.net/1721.1/112925 https://orcid.org/0000-0003-3803-5703 https://orcid.org/0000-0003-1333-4045 |