Randomized Self-Assembly for Exact Shapes
From MaRDI portal
Publication:5390605
DOI10.1137/090779152zbMath1247.68318arXiv0901.1849OpenAlexW2570868738MaRDI QIDQ5390605
Publication date: 4 April 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.1849
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Randomized algorithms (68W20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
The complexity of multiple handed self-assembly, Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly, Reducing tile complexity for the self-assembly of scaled shapes through temperature programming, The need for seed (in the abstract Tile Assembly Model), Tile complexity of approximate squares, Program size and temperature in self-assembly, Concentration independent random number generation in tile self-assembly, A minimal requirement for self-assembly of lines in polylogarithmic time, Parallel Computation Using Active Self-assembly, Fast arithmetic in algorithmic self-assembly, Parallel computation using active self-assembly, Parallelism and Time in Hierarchical Self-Assembly, Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue, Unnamed Item, An introduction to tile-based self-assembly and a survey of recent results
