Plasmids to Solve #3SAT
Tom Head,  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 , 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 .
KeywordsPropositional Logic Restriction Enzyme Site Multiple Cloning Site Truth Assignment Satisfying Assignment
Unable to display preview. Download preview PDF.
- 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
- 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