Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A comparison of resource-bounded molecular computation models

From MaRDI portal
Publication:1293873
Jump to:navigation, search

DOI10.1007/PL00009276zbMATH Open0934.68050OpenAlexW3103990451MaRDI QIDQ1293873FDOQ1293873


Authors: Bin Fu, Richard Beigel Edit this on Wikidata


Publication date: 25 April 2000

Published in: Algorithmica (Search for Journal in Brave)

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




Recommendations

  • Molecular computing, bounded nondeterminism, and efficient recursion
  • Molecular computing, bounded nondeterminism, and efficient recursion
  • Parallel biomolecular computation: Models and simulations
  • Publication:4942034


zbMATH Keywords

algorithm's complexitymolecular algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)







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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1293873&oldid=13401693"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 10:50. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki