Abstract
An algorithm that could be implemented at a molecular level for solving the satisfiability of Boolean expressions is presented.
This algorithm, based on properties of specific sets of natural numbers, does not require an extraction phase for the read out of the solution.
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.
References
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Adleman, L.M.: On constructing a molecular computer. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol. 27, pp. 1–22. American Mathematical Society (1995)
Bae, J.: On generalized subset-sum-distinct sequences. Int. J. Pure Appl. Math. 1(3), 343–352 (2002)
Braich, R.S., Chelyapov, N., Johnson, C., Rothemund, P.W.K., Adleman, L.: Solution to a 20-variable 3-SAT problem on a DNA computer. Science 296(5567), 499–502 (2002)
Brauer, A.: On a problem of partitions. Amer. J. Math. 64, 299–312 (1942)
Faulhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Molecular computation: RNA solutions to chess problems. Proc. Nat. Acad. Sci. USA 97, 13690–13695 (2000)
Frisco, P., Tengely, S.: On unique-sum sets (manuscript in preparation, 2005)
Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Co, San Francisco (1979)
Jonoska, N., Karl, S.A., Saito, M.: Three dimensional DNA structures in computing. BioSystems 52, 243–253 (1999)
Khodor, Y., Khodor, J., Knight Jr., T.F.: Experimental conformation of the basic principles of length-only discrimination. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, p. 223. Springer, Heidelberg (2002)
Lipton, R.J.: Using DNA to solve NP-complete problems. Science 268, 542–545 (1995)
Liu, Q., Wang, L., Frutos, A.G., Condon, A.E., Corn, R.M., Smith, L.M.: DNA computing on surfaces. Nature 403 (2000)
Manca, V., Zandron, C.: A DNA algorithm for 3-SAT(11,20). In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340. Springer, Heidelberg (2002)
Papadimitriou, C.H.: Computational complexity. Addison-Wesley Pub. Co., Reading (1994)
Pólya, G.: On picture-writing. Amer. Math. Monthly 63, 689–697 (1956)
Sakamoto, K., Gounzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular computation by DNA hairpin formation. Science 288, 1223–1226 (2000)
Schmidt, K.A., Henkel, C.V., Rozenberg, G., Spaink, H.P.: DNA computing using single-molecule hybridization detection. Nucleic acid research 32, 4962–4968 (2004)
Wilf, H.S.: A circle-of-lights algorithm for the money-changing problem. Amer. Math. Monthly 85(7), 562–565 (1978)
Yokomori, T., Sakakibara, Y., Kobayashi, S.: A magic pot: Self-assembly computation revisited. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 418–429. Springer, Heidelberg (2002)
Yoshida, H., Suyama, A.: Solution to 3-SAT by breadth first search. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 54, pp. 9–22. American Mathematical Society (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frisco, P., Henkel, C., Tengely, S. (2006). An Algorithm for SAT Without an Extraction Phase. In: Carbone, A., Pierce, N.A. (eds) DNA Computing. DNA 2005. Lecture Notes in Computer Science, vol 3892. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753681_6
Download citation
DOI: https://doi.org/10.1007/11753681_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34161-1
Online ISBN: 978-3-540-34165-9
eBook Packages: Computer ScienceComputer Science (R0)