Tight bounds on the directed tile complexity of a just-barely 3D \(2 \times N\) rectangle at temperature 1

DOI10.1007/978-3-031-34034-5_6OpenAlexW4378771994MaRDI QIDQ6149118

Hailey Vadnais, David Furcy, Scott M. Summers

Publication date: 12 January 2024

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34034-5_6

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• The program-size complexity of self-assembled squares (extended abstract)
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• Intrinsic universality in tile self-assembly requires cooperation
• Complexity of Self‐Assembled Shapes

This page was built for publication: Tight bounds on the directed tile complexity of a just-barely 3D \(2 \times N\) rectangle at temperature 1