All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size

DOI10.1007/11925903_4zbMath1132.68404OpenAlexW1488241959MaRDI QIDQ5452560

Carlos Martín-Vide, Florin Manea, Victor Mitrana

Publication date: 4 April 2008

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11925903_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (9)

Simulating polarization by random context filters in networks of evolutionary processors ⋮ Networks of splicing processors: simulations between topologies ⋮ Small networks of polarized splicing processors are universal ⋮ Networks of picture processors as problem solvers ⋮ Filters defined by random contexts versus polarization in networks of evolutionary processors ⋮ Networks of splicing processors with evaluation sets as optimization problems solvers ⋮ On small, reduced, and fast universal accepting networks of splicing processors ⋮ Polarization: a new communication protocol in networks of bio-inspired processors ⋮ A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors

This page was built for publication: All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size