The fewest clues problem

The fewest clues problem

Show other versions (1)

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...

Full description

Bibliographic Details
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:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items