A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE

DOI10.1142/S0129054103002096zbMATH Open1101.68575MaRDI QIDQ5696946FDOQ5696946

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)

Recommendations

• scientific article; zbMATH DE number 1189120
• scientific article; zbMATH DE number 871944
• scientific article; zbMATH DE number 1241360
• scientific article; zbMATH DE number 1241370
• scientific article; zbMATH DE number 1369845

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

• Title not available (Why is that?)
• On the power of DNA-computing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Membrane computing and complexity theory: A characterization of PSPACE
• P systems with proteins on membranes characterize PSPACE
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)