An Algorithm for SAT Without an Extraction Phase

DOI10.1007/11753681_6zbMath1234.68457OpenAlexW2207358MaRDI QIDQ3618681

Christiaan V. Henkel, Pierluigi Frisco, 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)

Related Items (2)

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

Cites Work

• On Picture-Writing
• A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
• On a Problem of Partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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