Arithmetic computation in the tile assembly model: addition and multiplication

DOI10.1016/j.tcs.2006.10.025zbMath1118.68063OpenAlexW2051595055MaRDI QIDQ884443

Yuriy Brun

Publication date: 6 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.025

zbMATH Keywords

multipliercrystal growthself-assemblytile assembly modeladdermolecular computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (9)

Efficient 3-SAT algorithms in the tile assembly model ⋮ Covert computation in self-assembled circuits ⋮ Nondeterministic polynomial time factoring in the tile assembly model ⋮ Solving NP-complete problems in the tile assembly model ⋮ Fast arithmetic in algorithmic self-assembly ⋮ Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions ⋮ Unnamed Item ⋮ Improving Efficiency of 3-SAT-Solving Tile Systems ⋮ Path finding in the tile assembly model

Cites Work

• Unnamed Item
• Undecidability and nonperiodicity for tilings of the plane
• The program-size complexity of self-assembled squares (extended abstract)
• Combinatorial optimization problems in self-assembly
• Reducing tile complexity for self-assembly through temperature programming
• Self-correcting Self-assembly: Growth Models and the Hammersley Process
• The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• DNA Computing
• DNA Computing
• DNA Computing
• DNA Computing

This page was built for publication: Arithmetic computation in the tile assembly model: addition and multiplication