Complexity results for deciding networks of evolutionary processors

DOI10.1016/J.TCS.2012.06.029zbMath1279.68084OpenAlexW2104457185MaRDI QIDQ714866

Florin Manea

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.029

zbMATH Keywords

computational complexitynormal formnetworks of evolutionary processors\(\mathbf P^{\mathbf {NP}[\log}\)]

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Networks of picture processors as problem solvers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small universal accepting hybrid networks of evolutionary processors
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• On the size of computationally complete hybrid networks of evolutionary processors
• On Normal Forms for Networks of Evolutionary Processors
• Deciding According to the Shortest Computations
• Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof
• Deciding Networks of Evolutionary Processors
• On the Computational Complexity of Algorithms
• DNA Computing
• On the size complexity of universal accepting hybrid networks of evolutionary processors

This page was built for publication: Complexity results for deciding networks of evolutionary processors