Nearly constant tile complexity for any shape in two-handed tile assembly
type: Item
instance of: scholarly article
title: Nearly constant tile complexity for any shape in two-handed tile assembly
zbMATH Open document ID: 1425.68115
author: Andrew Winslow
author: Tim Wylie
author: Robert T. Schweller
published in: Algorithmica
publication date: 2019-06-27T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 7074465
zbMATH Keywords: self-assembly
zbMATH Keywords: hierarchical assembly
zbMATH Keywords: 2HAM
MaRDI profile type: Publication
full work available at URL: s00453-019-00573-w
OpenAlex ID: W2939716717
cites work: Running time and program size for self-assembled squares
cites work: Q5365065
cites work: Q2957882
cites work: Q5009571
cites work: Q5743467
cites work: Program size and temperature in self-assembly
cites work: Complexities for Generalized Models of Self-Assembly
cites work: The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
cites work: Limitations of Self-assembly at Temperature One
cites work: Intrinsic universality in tile self-assembly requires cooperation
cites work: The program-size complexity of self-assembled squares (extended abstract)
cites work: Programmable Control of Nucleation for Algorithmic Self-Assembly
cites work: Complexities for high-temperature two-handed tile self-assembly
cites work: On the Behavior of Tile Assembly System at High Temperatures
cites work: Complexity of Self‐Assembled Shapes
cites work: Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
cites work: Q4992866
Wikidata QID: Q128051736
DOI: 10.1007/S00453-019-00573-W
Recommended article: On Times to Compute Shapes in 2D Tile Self-assembly
Recommended article: The Tile Complexity of Linear Assemblies
Recommended article: Tile Complexity of Linear Assemblies
Recommended article: The Complexity of Fixed-Height Patterned Tile Self-assembly
Recommended article: Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
Recommended article: Solving satisfiability in the tile assembly model with a constant-size tileset
Recommended article: Q6076672
Recommended article: Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D
Recommended article: Solving NP-complete problems in the tile assembly model
description: scientific article; zbMATH DE number 7074465