Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.

DOI10.1016/S0304-3975(02)00095-6zbMath1061.68074OpenAlexW1969885872MaRDI QIDQ1853479

Kensaku Sakamoto, Masami Hagiya, John A. Rose, Ken Komiya

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00095-6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Biochemistry, molecular biology (92C40)

Cites Work

• On the power of DNA-computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.