On the power of DNA-computing

DOI10.1006/INCO.1996.0094zbMath1077.68647OpenAlexW2037375334MaRDI QIDQ675064

Klaus W. Wagner, Diana Rooß

Publication date: 16 October 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c629ac7e6fd14f8ee173bd6e2c305330183630f6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Unnamed Item ⋮ A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE ⋮ Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.

This page was built for publication: On the power of DNA-computing