Any monotone function is realized by interlocked polygons

DOI10.3390/A5010148MaRDI QIDQ1736502zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a5010148

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Boolean functions (06E30)

Recommendations

• Interlocked open and closed linkages with few joints.
• Mathematical characterizations and computational complexity of anti-slide puzzles
• scientific article; zbMATH DE number 4062595
• Untangling a polygon
• scientific article; zbMATH DE number 2084274

Cited in

(3)

• Logic circuits from zero forcing
• Mathematical characterizations and computational complexity of anti-slide puzzles
• Picture-hanging puzzles

This page was built for publication: Any monotone function is realized by interlocked polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736502)