An Algorithm for SAT Without an Extraction Phase

DOI10.1007/11753681_6MaRDI QIDQ3618681zbMATH OpenOpenAlexFDO

Authors Pierluigi Frisco, Christiaan V. Henkel, Szabolcs Tengely

Publication date 2 April 2009

Published in DNA Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753681_6

zbMATH Keywords

satisfiability of Boolean expressions

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• Theoretical Computer Science
• scientific article; zbMATH DE number 2087017
• Molecular computing, bounded nondeterminism, and efficient recursion
• scientific article; zbMATH DE number 1342109

Cites work

• scientific article; zbMATH DE number 1803243 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2087017 (Why is no real title available?)
• scientific article; zbMATH DE number 2087022 (Why is no real title available?)
• scientific article; zbMATH DE number 2087507 (Why is no real title available?)
• scientific article; zbMATH DE number 1568795 (Why is no real title available?)
• A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
• On Picture-Writing
• On a Problem of Partitions

Cited in

(2)

• Exact cover with light
• Solving the Hamiltonian path problem with a light-based computer

This page was built for publication: An Algorithm for SAT Without an Extraction Phase

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618681)