Show simple item record

dc.contributor.authorDemaine, Erik D.
dc.contributor.authorDemaine, Martin L.
dc.contributor.authorMinsky, Yair N.
dc.contributor.authorMitchell, Joseph S. B.
dc.contributor.authorRivest, Ronald L.
dc.contributor.authorPatrascu, Mihai
dc.date.accessioned2012-08-28T20:47:41Z
dc.date.available2012-08-28T20:47:41Z
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/1721.1/72400
dc.description.abstractWe show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. This construction makes for some fun mathematical magic performances. More generally, we characterize the possible Boolean functions characterizing when the picture falls in terms of which nails get removed as all monotone Boolean functions. This construction requires an exponential number of twists in the worst case, but exponential complexity is almost always necessary for general functions.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (NSF grant CCF-1018388)en_US
dc.language.isoen_US
dc.publisherSpringer-Verlagen_US
dc.relation.isversionofhttp://dx.doi.org/ 10.1007/978-3-642-30347-0_11en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourcearXiven_US
dc.titlePicture-hanging puzzlesen_US
dc.typeArticleen_US
dc.identifier.citationDemaine, Erik D. et al. “Picture-Hanging Puzzles.” Fun with Algorithms. Ed. Evangelos Kranakis, Danny Krizanc, & Flaminia Luccio. (Lecture Notes in Computer Science ; Vol. 7288) Berlin: Springer Berlin Heidelberg, 2012. pp.81–93. Web.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverRivest, Ronald L.
dc.contributor.mitauthorDemaine, Erik D.
dc.contributor.mitauthorDemaine, Martin L.
dc.contributor.mitauthorRivest, Ronald L.
dc.relation.journalFun With Algorithmsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsDemaine, Erik D.; Demaine, Martin L.; Minsky, Yair N.; Mitchell, Joseph S. B.; Rivest, Ronald L.; Pǎtraşcu, Mihaien
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
dc.identifier.orcidhttps://orcid.org/0000-0002-7105-3690
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record