Abstract
Previously a 28-tile multiplier system which computes the product of two numbers was proposed by Brun. However the tileset-size is not optimal. In this paper we prove that multiplication can be carried out using less tile types while maintaining the same time efficiency: we propose two new tile assembly systems, both can deterministically compute A*B for given A and B in constant time. Our first system requires 24 computational tile types while our second system requires 16 tile types, which achieve smaller constants than Brun’s 28-tile multiplier system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021–1024 (1994)
Lipton, R.: Using dna to solve np-complete problems. Science 268(4) (1995)
Liu, Q., Wang, L., Frutos, A., Condon, A., Corn, R., Smith, L., et al.: Dna computing on surfaces. Nature 403(6766), 175–179 (2000)
Ouyang, Q., Kaplan, P., Liu, S., Libchaber, A.: Dna solution of the maximal clique problem. Science 278(5337), 446–449 (1997)
Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 459–468. ACM (2000)
Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology (1998)
Winfree, E., Liu, F., Wenzler, L., Seeman, N., et al.: Design and self-assembly of two-dimensional dna crystals. Nature 394(6693), 539–544 (1998)
Barish, R., Rothemund, P., Winfree, E.: Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters 5(12), 2586–2592 (2005)
Rothemund, P., Papadakis, N., Winfree, E.: Algorithmic self-assembly of dna sierpinski triangles. PLoS Biology 2(12), e424 (2004)
Brun, Y.: Solving np-complete problems in the tile assembly model. Theoretical Computer Science 395(1), 31–46 (2008)
Brun, Y.: Improving efficiency of 3-SAT-solving tile systems. In: Sakakibara, Y., Mi, Y. (eds.) DNA 16 2010. LNCS, vol. 6518, pp. 1–12. Springer, Heidelberg (2011)
Lagoudakis, M., LaBean, T.: 2-d dna self-assembly for satisfiability. In: DNA Based Computers V, vol. 54, pp. 141–154 (2000)
Brun, Y.: Arithmetic computation in the tile assembly model: Addition and multiplication. Theoretical Computer Science 378(1), 17–31 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Fang, X., Lai, X. (2014). Multiplier System in the Tile Assembly Model with Reduced Tileset-Size. In: Abraham, A., Krömer, P., Snášel, V. (eds) Innovations in Bio-inspired Computing and Applications. Advances in Intelligent Systems and Computing, vol 237. Springer, Cham. https://doi.org/10.1007/978-3-319-01781-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-01781-5_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01780-8
Online ISBN: 978-3-319-01781-5
eBook Packages: EngineeringEngineering (R0)