Complexity results for deciding networks of evolutionary processors
DOI10.1016/J.TCS.2012.06.029zbMATH Open1279.68084OpenAlexW2104457185MaRDI QIDQ714866FDOQ714866
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
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
computational complexitynormal formnetworks of evolutionary processors\(\mathbf P^{\mathbf {NP}[\log}\)]
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accepting hybrid networks of evolutionary processors with special topologies and small communication
- On the Computational Complexity of Algorithms
- DNA Computing
- A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
- On the size complexity of universal accepting hybrid networks of evolutionary processors
- Small universal accepting hybrid networks of evolutionary processors
- Filter position in networks of evolutionary processors does not matter: a direct proof
- Accepting networks of evolutionary word and picture processors: a survey
- Deciding according to the shortest computations
- Deciding networks of evolutionary processors
Cited In (6)
- Title not available (Why is that?)
- 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)
