On Accepting Networks of Splicing Processors of Size 3

DOI10.1007/978-3-540-73001-9_52MaRDI QIDQ5425352zbMATH OpenOpenAlexFDO

Authors Remco Loos

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_52

zbMATH Keywords

Molecular ComputationNetworks of ProcessorsSplicing

Mathematics Subject Classification ID

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

Recommendations

• On small, reduced, and fast universal accepting networks of splicing processors
• All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
• Accepting Networks of Splicing Processors with Filtered Connections
• New Computational Paradigms
• Networks of Polarized Splicing Processors

Cited in

(7)

• On small, reduced, and fast universal accepting networks of splicing processors
• Accepting Networks of Splicing Processors with Filtered Connections
• Generating networks of splicing processors
• Networks of Polarized Splicing Processors
• All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
• New Computational Paradigms
• Accepting networks of splicing processors: complexity results

This page was built for publication: On Accepting Networks of Splicing Processors of Size 3

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