Paper by Martin L. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara, “Any Monotone Boolean Function Can Be Realized by Interlocked Polygons”, in Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), Winnipeg, Manitoba, Canada, August 9–11, 2010, pages 139–142.

Length:

The paper is 4 pages.

Availability:

The paper is available in PDF (296k).

See information on file formats.

[Google Scholar search]

Related webpages:

Interlocked Polygons