A CONSTANT TIME ALGORITHM FOR DNA ADD

DOI10.1142/S0129054109006723MaRDI QIDQ3636161zbMATH OpenOpenAlexFDO

Authors

Publication date 30 June 2009

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054109006723

zbMATH Keywords

Boolean circuitsDNA computingparallel processing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1953212
• scientific article; zbMATH DE number 1241367
• PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES
• DNA ternary addition
• scientific article; zbMATH DE number 2087031

Cites work

• DNA computing, sticker systems, and universality
• Efficient DNA sticker algorithms for NP-complete graph problems
• Multiplying with DNA
• On the computational power of DNA
• PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES
• Simulating Boolean circuits on a DNA computer
• The time complexity of updating snapshot memories
• Theoretical and experimental DNA computation.
• Topics in the theory of DNA computing.

Cited in

(3)

• scientific article; zbMATH DE number 1241367 (Why is no real title available?)
• scientific article; zbMATH DE number 1953212 (Why is no real title available?)
• DNA ternary addition

This page was built for publication: A CONSTANT TIME ALGORITHM FOR DNA ADD

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