<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Picture-Hanging Puzzles · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1203.3602/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1203.3602/feed.xml" rel="self" type="application/rss+xml" /><item><title>Picture-Hanging Puzzles — mentioned by TheNewAndy</title><link>https://news.ycombinator.com/item?id=25626395</link><guid isPermaLink="false">urn:hackerpapers:mention:1203.3602:25626395</guid><pubDate>Sun, 03 Jan 2021 23:41:50 GMT</pubDate><description>&lt;p&gt;See also: https://arxiv.org/pdf/1203.3602.pdf You can also encode any monotone boolean function by hanging a picture on the wall on N nails (one nail per variable). e.g. a &amp;quot;normal&amp;quot; hanging of a picture on two nails would encode an AND gate (it only falls if both nails are removed). But by twisting the string the right way, you can make it encode an OR gate (so it falls if either nail is removed).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1203.3602/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Picture-Hanging Puzzles — HN submission</title><link>https://news.ycombinator.com/item?id=3728256</link><guid isPermaLink="false">urn:hackerpapers:submission:1203.3602:3728256</guid><pubDate>Tue, 20 Mar 2012 07:58:00 GMT</pubDate><description>&lt;p&gt;How to hang a picture using n nails such that removing any k nails makes it fall&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;128 points; 26 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1203.3602/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
