An Algorithm for SAT Without an Extraction Phase

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.

• Type: Conference
• Year: 2005
• Where: DNA
• Authors: Pierluigi Frisco, Christiaan Henkel, Szabolcs Tengely
• Keywords: Boolean Expressions, DNA 2005, Molecular Level, Specific Sets