Accepting networks of evolutionary word and picture processors: a survey
From MaRDI portal
Publication:3018967
zbMATH Open1230.68072MaRDI QIDQ3018967FDOQ3018967
Authors: Florin Manea, Carlos Martín-Vide, Victor Mitrana
Publication date: 27 July 2011
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (12)
- Complexity results for deciding networks of evolutionary processors
- Accepting networks of evolutionary processors with subregular filters
- Simulating polarization by random context filters in networks of evolutionary processors
- Networks of picture processors as problem solvers
- Accepting networks of evolutionary picture processors
- Accepting networks of genetic processors are computationally complete
- A linear time solution for \(N\)-queens problem using generalized networks of evolutionary polarized processors
- Networks of picture processors with circular permutation
- Universality in Molecular and Cellular Computing
- Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors
- Generating networks of splicing processors
- Title not available (Why is that?)
This page was built for publication: Accepting networks of evolutionary word and picture processors: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3018967)