New Computational Paradigms

DOI10.1007/b136981zbMath1113.68401OpenAlexW2278484831MaRDI QIDQ5717054

Florin Manea, Carlos Martín-Vide, Victor Mitrana

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136981

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Simulating polarization by random context filters in networks of evolutionary processors ⋮ Accepting networks of splicing processors: complexity results ⋮ Filters defined by random contexts versus polarization in networks of evolutionary processors ⋮ Accepting networks of genetic processors are computationally complete ⋮ Networks of splicing processors with evaluation sets as optimization problems solvers

This page was built for publication: New Computational Paradigms