Skip to main content
Conference Proceedings

An algorithm for SAT without an extraction phase

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3892 LNCS 67-80
DOI: 10.1007/11753681_6
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Frisco, P., Henkel, C., & Tengely, S. (2006). An algorithm for SAT without an extraction phase. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3892 LNCS, pp. 67–80). https://doi.org/10.1007/11753681_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free