A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE

DOI10.1142/S0129054103002096MaRDI QIDQ5696946zbMATH OpenFDO

Authors E. Ya. Dantsin, Alexander Wolpert

Publication date 19 October 2005

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

zbMATH Keywords

DNA computingPSPACEquantified Boolean formulasDNA computation modelreliable DNA operations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites work

• scientific article; zbMATH DE number 1189120 (Why is no real title available?)
• scientific article; zbMATH DE number 1241366 (Why is no real title available?)
• scientific article; zbMATH DE number 1241372 (Why is no real title available?)
• scientific article; zbMATH DE number 1369845 (Why is no real title available?)
• On the power of DNA-computing

Cited in

(6)

• Membrane computing and complexity theory: A characterization of PSPACE
• P systems with proteins on membranes characterize PSPACE
• scientific article; zbMATH DE number 5630435 (Why is no real title available?)
• scientific article; zbMATH DE number 1189120 (Why is no real title available?)
• A novel DNA computing model based on RecA-mediated triple-stranded DNA structure
• P systems with proteins on membranes: a survey

This page was built for publication: A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE

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