Computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors
From MaRDI portal
Publication:2400997
DOI10.1007/978-3-319-60252-3_11zbMath1426.68086OpenAlexW2621239335MaRDI QIDQ2400997
Vladimir Rogozhin, Sergey Verlan, Rudolf Freund
Publication date: 31 August 2017
Full work available at URL: https://hal.inria.fr/hal-01657015/file/440206_1_En_11_Chapter.pdf
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (2)
This page was built for publication: Computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors