Is DNA computing viable for 3-SAT problems?
From MaRDI portal
Publication:1401219
DOI10.1016/S0304-3975(02)00533-9zbMath1044.68070MaRDI QIDQ1401219
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
68Q25: Analysis of algorithms and problem complexity
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Cites Work