On the power of DNA-computing

DOI10.1006/INCO.1996.0094MaRDI QIDQ675064zbMATH OpenOpenAlexFDO

Authors Diana Rooß, K. W. Wagner

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

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

Recommendations

• scientific article; zbMATH DE number 1156876
• DNA models and algorithms for NP-complete problems
• On the computational power of DNA

Cited in

(13)

• DNA models and algorithms for NP-complete problems
• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• DNA computing by blocking
• Solving traveling salesman problem in the Adleman-Lipton model
• scientific article; zbMATH DE number 1241371 (Why is no real title available?)
• scientific article; zbMATH DE number 1241381 (Why is no real title available?)
• scientific article; zbMATH DE number 1072534 (Why is no real title available?)
• scientific article; zbMATH DE number 2040825 (Why is no real title available?)
• scientific article; zbMATH DE number 1369845 (Why is no real title available?)
• scientific article; zbMATH DE number 1418472 (Why is no real title available?)
• A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE
• On the computational power of DNA
• How ciliates manipulate their own DNA -- A splendid example of natural computing

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

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