Networks of picture processors as problem solvers
From MaRDI portal
Publication:1746794
DOI10.1007/s00500-016-2206-yzbMath1472.68054OpenAlexW2415418938MaRDI QIDQ1746794
Henning Bordihn, Anna Labella, Victor Mitrana, Paolo Bottoni
Publication date: 26 April 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-016-2206-y
Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity results for deciding networks of evolutionary processors
- Characterizations of recognizable picture series
- ON ARRAY GRAMMARS AND LANGUAGES
- Hierarchical Structures and Complexities of Parallel Isometric Languages
- Sequential/Parallel Matrix Array Languages
- Visual Language Theory
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Running time and program size for self-assembled squares
- Complexities for Generalized Models of Self-Assembly
- Accepting Networks of Evolutionary Picture Processors
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
- DNA Computing
- Picture languages with array rewriting rules
- Machines, Computations, and Universality
This page was built for publication: Networks of picture processors as problem solvers