Solving constraint satisfaction problems with DNA computing

DOI10.1007/3-540-45655-4_20MaRDI QIDQ4808635zbMATH OpenFDO

Authors E. Ya. Dantsin, Alexander Wolpert

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2387/23870171.htm

Mathematics Subject Classification ID

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

Recommendations

• On the computational power of DNA
• DNA models and algorithms for NP-complete problems
• scientific article; zbMATH DE number 1156876
• A space-efficient randomized DNA algorithm for \textit{k}-SAT
• scientific article; zbMATH DE number 1342109

Cited in

(10)

• A computational DNA solution approach for the quadratic Diophantine equation
• Multi-constraint knapsack problem based on DNA computing
• scientific article; zbMATH DE number 1342106 (Why is no real title available?)
• A comment on ``Biological computation of the solution to the quadratic assignment problem
• Solution of a satisfiability problem on a gel-based DNA computer
• Solving computational learning problems of Boolean formulae on DNA computers
• A DNA-based random walk method for solving k-SAT
• Aspects of Molecular Computing
• On the computational power of DNA
• New algorithms for some NP-optimization problems by DNA computing

This page was built for publication: Solving constraint satisfaction problems with DNA computing

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