scientific article; zbMATH DE number 6783417
From MaRDI portal
zbMath1377.68081MaRDI QIDQ5365065
Ehsan Chiniforooshan, Lila Kari, David Doty, Nathaniel Bryans, Shinnosuke Seki
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133082
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
The complexity of multiple handed self-assembly, Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly, Self-assembly of infinite structures: a survey, Nearly constant tile complexity for any shape in two-handed tile assembly, Fast arithmetic in algorithmic self-assembly, Unnamed Item, An introduction to tile-based self-assembly and a survey of recent results