Advertisement

Plasmids to Solve #3SAT

  • Rani Siromoney
  • Bireswar Das
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2950)

Abstract

Tom Head, [1] has given a simple and elegant method of aqueous computing to solve 3SAT. The procedure makes use of Divide-Delete-Drop operations performed on plasmids. In [4], a different set of operations, Cut-Expand-Ligate, are used to solve several NP-Complete problems. In this paper, we combine the features in the two procedures and define Cut-Delete-Expand-Ligate which is powerful enough to solve #3SAT, which is a counting version of 3SAT known to be in IP. The solution obtained is advantageous to break the propositional logic based cryptosystem introduced by J. Kari [5].

Keywords

Propositional Logic Restriction Enzyme Site Multiple Cloning Site Truth Assignment Satisfying Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Head, T.: Circular Suggestions for DNA Computing. In: Carbone, A., Gromov, M., Prusinkeiwicz, P. (eds.) Pattern Formation in Biology, Vision and Dynamics, pp. 325–335. World Scientific, Singapore (2000)CrossRefGoogle Scholar
  2. 2.
    Head, T.: Splicing Systems, Aqueous Computing, and Beyond. In: Antoniou, I., Calude, C.S., Dinneen, M.J. (eds.) Unconventional Models of Computation, UMC 2000, pp. 68–84. Springer, Berlin (2001)Google Scholar
  3. 3.
    Head, T., Rozenberg, G., Bladergreen, R.S., Breek, C.K.D., Lommerse, P.H.M., Spaink, H.P.S.: Computing with DNA by Operating on Plasmids. BioSystems 57, 87–93 (2000)CrossRefGoogle Scholar
  4. 4.
    Head, T., Yamamura, M., Gal, S.: Aqueous Computing: Writing on Molecules. In: Proc. Congress on Evolutionary Computation 1999, pp. 1006–1010. IEEE Service Center, Piscataway (1999)Google Scholar
  5. 5.
    Kari, J.: A Cryptosystem based on Propositional Logic. In: Dassow, J., Kelemen, J. (eds.) IMYCS 1988. 5th International Meeting of Young Computer Scientists, vol. 381, pp. 210–219. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  6. 6.
    Siromoney, R., Bireswar, D.: DNA Algorithm for Breaking a Propositional Logic Based Cryptosystem. Bulletin of the EATCS 79, 170–176 (2003)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Rani Siromoney
    • 1
    • 2
  • Bireswar Das
    • 3
  1. 1.Madras Christian CollegeChennaiIndia
  2. 2.Chennai Mathematical InstituteChennaiIndia
  3. 3.Institute of Mathematical SciencesChennaiIndia

Personalised recommendations