Solving NP-complete problems with networks of evolutionary processors

DOI10.1007/3-540-45720-8_74MaRDI QIDQ2780162zbMATH OpenFDO

Authors Juan Castellanos, Carlos Martín-Vide, Victor Mitrana, Jose M. Sempere

Publication date 15 April 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2084/20840621

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Complexity results for deciding networks of evolutionary processors
• On the Power of Networks of Evolutionary Processors
• scientific article; zbMATH DE number 2001369
• Networks of evolutionary processors
• Hybrid networks of evolutionary processors are computationally complete
• Developments in networks of evolutionary processors
• A survey on computationally complete accepting and generating networks of evolutionary processors
• Networks of evolutionary processors: computationally complete normal forms
• Deciding networks of evolutionary processors
• Problem solving based on evolutionary neural network algorithms

Cited in

(32)

• Networks of evolutionary processors
• On the size complexity of hybrid networks of evolutionary processors
• Hybrid networks of evolutionary processors are computationally complete
• Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
• Communicating reaction systems with direct communication
• A survey on computationally complete accepting and generating networks of evolutionary processors
• On the size of computationally complete hybrid networks of evolutionary processors
• Networks of evolutionary processors: the power of subregular filters
• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• Networks of evolutionary processors: computationally complete normal forms
• Generating and accepting P systems with minimal left and right insertion and deletion
• Small universal devices
• String assembly in networks of evolutionary processors
• Universality in Molecular and Cellular Computing
• On the recognition of context-free languages using accepting hybrid networks of evolutionary processors
• On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
• scientific article; zbMATH DE number 2001369 (Why is no real title available?)
• scientific article; zbMATH DE number 1488086 (Why is no real title available?)
• scientific article; zbMATH DE number 7347652 (Why is no real title available?)
• Accepting networks of evolutionary processors with resources restricted and structure limited filters
• Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors
• Networks with evolutionary processors and ideals and codes as filters
• Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
• The role of evolutionary operations in accepting hybrid networks of evolutionary processors
• Single semi-contextual insertion-deletion systems
• On the number of evolutionary processors in networks with length-driven communication
• On a simulation of non-inserting accepting networks of evolutionary processors by length preserving iterated uniform finite state transducers
• Accepting networks of genetic processors are computationally complete
• Complexity results for deciding networks of evolutionary processors
• On the number of nodes in universal networks of evolutionary processors
• Accepting networks of splicing processors: complexity results
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors

This page was built for publication: Solving NP-complete problems with networks of evolutionary processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2780162)