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: | Fermi, Ma (Author), Schvartzman, Ariel (Author), Waingarten, Erik (Author), Demaine, Erik D (Contributor), Aaronson, Scott (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
2017-12-21T19:58:26Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
The fewest clues problem
by: Demaine, Erik D, et al.
Published: (2020) -
Dissection with the Fewest Pieces is Hard, Even to Approximate
by: Manurangsi, Pasin, et al.
Published: (2018) -
Playing Dominoes Is Hard, Except by Yourself
by: Demaine, Erik D., et al.
Published: (2015) -
Broadcast in Sparse Conversion Optical Networks Using Fewest Converters
by: Yi, Tong
Published: (2005) -
How the Fewest Become the Greatest. L. casei’s Impact on Long Ripened Cheeses
by: Benedetta Bottari, et al.
Published: (2018-11-01)