scientific article

DOI10.4086/toc.2013.v009a001zbMath1366.68054OpenAlexW2611061920MaRDI QIDQ3191568

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

Publication date: 6 October 2014

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2013.v009a001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

completenessnondeterminismpolynomial hierarchyself-assembly

Mathematics Subject Classification ID

Related Items (7)

The power of duples (in self-assembly): it's not so hip to be square ⋮ Verification in staged tile self-assembly ⋮ Asymptotic Properties of Combinatory Logic ⋮ Counting infinitely by oritatami co-transcriptional folding ⋮ Counting Infinitely by Oritatami Co-transcriptional Folding ⋮ Concentration independent random number generation in tile self-assembly ⋮ Parallelism and Time in Hierarchical Self-Assembly

Cites Work

• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• Self-assembly with Geometric Tiles
• Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
• Randomized Self-assembly for Approximate Shapes
• Reducing tile complexity for self-assembly through temperature programming
• Complexity of Self‐Assembled Shapes

This page was built for publication: