Is DNA computing viable for 3-SAT problems?

DOI10.1016/S0304-3975(02)00533-9zbMath1044.68070OpenAlexW1988993418MaRDI QIDQ1401219

Dafa Li

Publication date: 17 August 2003

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

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

zbMATH Keywords

Lipton's model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• DNA models and algorithms for NP-complete problems
• Using DNA to solve the bounded Post correspondence problem

This page was built for publication: Is DNA computing viable for 3-SAT problems?