Abstract
A well-defined satisfiability problem (SAT) is mapped into a unique expression of logical array by introducing a transformation. Such an expression forms a unique molecular algorithm for solving SAT, which is prone to computation on an electronic computer. A famous 20-variable instance of the three-satisfiability problem is solved via Matrix laboratory (MATLAB) installed on a notebook computer. The special computation implements huge parallelism that goes beyond 1 million (220).The unique solution is found and the computational complexity is analyzed.
Supported by the National Natural Science Foundation of China under Grant No. 60273007 and No.60131160743.
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 combination problems. science 266(11), 1021–1023 (1994)
Lipton, R.J.: DNA solution of hard computational problems. Science 268(28), 542–545 (1995)
Roweis, S., et al.: A sticker based model of DNA computation. In: Proceedings of the Second Annual Meeting on DNA-based computers (1996)
Bach, E., et al.: DNA model and algorithms for NP-complete problem. In: Proceedings of the 11th Annual Conference on Structure in Complexity Theory, pp. 290–299 (1996)
Smith, L.M., et al.: A surface-based approach to DNA computation. Journal of computational biology 5(2), 255–267 (1998)
Ouyang, Q., et al.: DNA solution of the maximal clique problem. Science 278, 446–449 (1997)
Liu, Q., et al.: DNA computing on surfaces. Natural 403(13), 175–178 (2000)
Sakamoto, K., et al.: Molecular computation by DNA hairpin formation. Science 288, 1223–1226 (2000)
Faulhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Proc. Natl. Acad. Sci. U.S.A. 97, 1385 (2000)
Roos, D., Wagner, K.: On the power of bio-computers. Information and Comoutation 131, 95–109 (1996)
Garzon, M.H., et al.: The bounded complexity of DNA computing. BioSystem 52, 63–72 (1999)
Braich, R.S., et al.: Solution of a 20-Variable 3-SAT Problem on a DNA Computer Science, vol. 296, pp. 499–502 (2002)
The used notebook computer is a Intel Pentium III (TOSHIBA 1300), 1.0 GHz-M, 384 MB (RAM), 30G HD, installed Microsoft® window® XP Home Edition. MBTLAB 6.0 is used
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, W., Zheng, W. (2003). An Effective Molecular Algorithm for Solving the Satisfiability Problem. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-39425-9_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20054-3
Online ISBN: 978-3-540-39425-9
eBook Packages: Springer Book Archive