Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 1241372

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

zbMath0919.68031MaRDI QIDQ4224901

Jiří Sgall, Richard J. Lipton, Christopher Dunworth, Dan Boneh

Publication date: 17 January 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

DNA computersvolume decreasing algorithms


Mathematics Subject Classification ID

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


Related Items (10)

Solving the minimum bisection problem using a biologically inspired computational model ⋮ DNA2DNA computations: A potential “killer app”? ⋮ On the scalability of biocomputing algorithms: the case of the maximum clique problem ⋮ Biological computation of the solution to the quadratic assignment problem ⋮ A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE ⋮ The emerging discipline of biomolecular computation in the US ⋮ An error-correcting code framework for genetic sequence analysis ⋮ Terminal pair maximal flow finding using DNA computation ⋮ Approximate reasoning on a DNA‐chip ⋮ On the computational power of DNA






This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4224901&oldid=18096396"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 14:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki