Complexity results for deciding networks of evolutionary processors

DOI10.1016/J.TCS.2012.06.029MaRDI QIDQ714866zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Deciding networks of evolutionary processors
• On the Power of Networks of Evolutionary Processors
• On the size complexity of hybrid networks of evolutionary processors
• ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS
• scientific article; zbMATH DE number 1728707
• On the size of computationally complete hybrid networks of evolutionary processors
• scientific article; zbMATH DE number 2001369
• Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
• Networks of evolutionary processors
• On the size complexity of universal accepting hybrid networks of evolutionary processors

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• Accepting hybrid networks of evolutionary processors with special topologies and small communication
• Accepting networks of evolutionary word and picture processors: a survey
• DNA Computing
• Deciding according to the shortest computations
• Deciding networks of evolutionary processors
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• Filter position in networks of evolutionary processors does not matter: a direct proof
• On normal forms for networks of evolutionary processors
• On the Computational Complexity of Algorithms
• On the size complexity of universal accepting hybrid networks of evolutionary processors
• On the size of computationally complete hybrid networks of evolutionary processors
• Small universal accepting hybrid networks of evolutionary processors

Cited in

(6)

• scientific article; zbMATH DE number 1728707 (Why is no real title available?)
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
• Networks of picture processors as problem solvers
• Deciding networks of evolutionary processors
• Complexity-preserving simulations among three variants of accepting networks of evolutionary processors

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

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