The power of nondeterminism in self-assembly

MaRDI QIDQ5365065zbMATH OpenFDO

Authors Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133082

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 6351478
• Program size and temperature in self-assembly
• Complexities for generalized models of self-assembly
• Program size and temperature in self-assembly
• Complexities for Generalized Models of Self-Assembly

Cited in

(11)

• An introduction to tile-based self-assembly and a survey of recent results
• Flipping tiles: concentration independent coin flips in tile self-assembly
• Nearly constant tile complexity for any shape in two-handed tile assembly
• Parallelism and time in hierarchical self-assembly
• Random Number Selection in Self-assembly
• Self-assembly of infinite structures: a survey
• The complexity of multiple handed self-assembly
• Non-determinism reduces construction time in active self-assembly using an insertion primitive
• Non-cooperative algorithms in self-assembly
• scientific article; zbMATH DE number 6351478 (Why is no real title available?)
• Nondeterministic polynomial time factoring in the tile assembly model

This page was built for publication: The power of nondeterminism in self-assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365065)