A comparison of resource-bounded molecular computation models

DOI10.1007/PL00009276MaRDI QIDQ1293873zbMATH OpenOpenAlexFDO

Authors Bin Fu, Richard Beigel

Publication date 25 April 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009276

zbMATH Keywords

algorithm's complexitymolecular algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Molecular computing, bounded nondeterminism, and efficient recursion
• Molecular computing, bounded nondeterminism, and efficient recursion
• Parallel biomolecular computation: Models and simulations
• scientific article; zbMATH DE number 1418472

Cited in

(2)

• Molecular computing, bounded nondeterminism, and efficient recursion
• Molecular computing, bounded nondeterminism, and efficient recursion

This page was built for publication: A comparison of resource-bounded molecular computation models

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