scientific article; zbMATH DE number 1072534

zbMATH Open0880.68042MaRDI QIDQ4359461FDOQ4359461

Authors: Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer, Janos Simon 

Publication date: 8 October 1997

Title of this publication is not available (Why is that?)

Recommendations

• On applying molecular computation to binary linear codes
• scientific article; zbMATH DE number 1330034
• scientific article; zbMATH DE number 1156876
• On the power of DNA-computing
• scientific article; zbMATH DE number 1860687

zbMATH Keywords

Hamiltonian path problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (15)

• Title not available (Why is that?)
• Biocomputing system of living cells
• An RNA-based theory of natural universal computation
• Verifying polymer reaction networks using bisimulation
• DNA Computing
• On Restricted Bio-Turing Machines
• Efficient Turing-universal computation with DNA polymers
• Time complexity of computation and construction in the chemical reaction network-controlled tile assembly model
• Programming in biomolecular computation
• Title not available (Why is that?)
• On applying molecular computation to binary linear codes
• Title not available (Why is that?)
• Some wonders of a bio-computer-scientist
• BIOMICS: a Theory of Interaction Computing
• Incremental building in peptide computing to solve Hamiltonian path problem

This page was built for publication:

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