Complexities for high-temperature two-handed tile self-assembly

DOI10.1007/978-3-319-66799-7_7zbMath1496.68143OpenAlexW2745406620MaRDI QIDQ1694417

Andrew Winslow, Tim Wylie, Robert T. Schweller

Publication date: 2 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66799-7_7

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (8)

The complexity of multiple handed self-assembly ⋮ Verification in staged tile self-assembly ⋮ Complexity of verification in self-assembly with prebuilt assemblies ⋮ Unique assembly verification in two-handed self-assembly ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nearly constant tile complexity for any shape in two-handed tile assembly ⋮ Optimal staged self-assembly of linear assemblies

This page was built for publication: Complexities for high-temperature two-handed tile self-assembly