Any monotone function is realized by interlocked polygons

DOI10.3390/a5010148zbMath1461.68241OpenAlexW2055678622MaRDI QIDQ1736502

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

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Logic circuits from zero forcing ⋮ Mathematical characterizations and computational complexity of anti-slide puzzles

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