An algorithm for SAT without an extraction phase

Authors:
Pierluigi Frisco;Christiaan Henkel;Szabolcs Tengely
Affiliations:
Dept. of Comp. Sci., School of Eng., C. S. and Math., University of Exeter, Exeter, UK;Institute of Biology, Leiden University, Leiden, The Netherlands;Mathematical Institute, Leiden University, Leiden, The Netherlands
Venue:
DNA'05 Proceedings of the 11th international conference on DNA Computing
Year:
2005

Citing 3
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Experimental Conformation of the Basic Principles of Length-only Discrimination

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
A magic pot: self-assembly computation revisited

Formal and natural computing

Quantified Score

Hi-index	0.00

Visualization

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.