On small, reduced, and fast universal accepting networks of splicing processors
type: Item
instance of: scholarly article
title: On small, reduced, and fast universal accepting networks of splicing processors
zbMATH Open document ID: 1160.68014
author: Remco Loos
author: Florin Manea
author: Victor Mitrana
published in: Theoretical Computer Science
publication date: 2009-03-02T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 5522104
zbMATH Keywords: molecular computation
zbMATH Keywords: splicing
zbMATH Keywords: networks of processors
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.09.048
OpenAlex ID: W2001035485
cites work: Q4886801
cites work: Q5636862
cites work: On the Computational Complexity of Algorithms
cites work: Q5592246
cites work: Accepting networks of splicing processors: complexity results
cites work: All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
cites work: On the size complexity of universal accepting hybrid networks of evolutionary processors
cites work: All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
cites work: DNA Computing
cites work: TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
cites work: Q4414692
cites work: Small fast universal Turing machines
cites work: Q3221403
cites work: Q3838831
cites work: Q3125167
cites work: Q4362740
cites work: Q4267178
DOI: 10.1016/J.TCS.2008.09.048
description: scientific article; zbMATH DE number 5522104