Automating the DNA Computer: Solving n-Variable 3-SAT Problems

DOI10.1007/11925903_28zbMATH Open1132.68398OpenAlexW1598551012MaRDI QIDQ5452586FDOQ5452586

Authors: Clifford R. Johnson 

Publication date: 4 April 2008

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11925903_28

Recommendations

• Automating the DNA computer: Solving \(n\)-variable 3-SAT problems
• scientific article; zbMATH DE number 1738639
• scientific article; zbMATH DE number 1342109
• On the computational power of DNA
• Modeling Non-specific Binding in Gel-Based DNA Computers

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (10)

• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• Title not available (Why is that?)
• Automated design and programming of a microfluidic DNA computer
• Modeling Non-specific Binding in Gel-Based DNA Computers
• Aspects of Molecular Computing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Abstraction layers for scalable microfluidic biocomputing
• Automating the DNA computer: Solving \(n\)-variable 3-SAT problems
• Title not available (Why is that?)

This page was built for publication: Automating the DNA Computer: Solving n-Variable 3-SAT Problems

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