A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem

Description

A tissue P system with cell division is a computing model which has two basic features: intercellular communication and the ability of cell division. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to computationally hard problems in polynomial time. In this work we present an efficient solution to the tripartite matching problem by a family of such devices. This solution leads to an interesting open problem whether tissue P systems with cell division and communication rules of length 2 can solve NP-complete problems. An answer to this open problem will provide a borderline between efficiency and non-efficiency in terms of the lengths of communication rules

Abstract

Ministerio de Educación y Ciencia TIN2009-13192

Abstract

Junta de Andalucía P08-TIC-04200

Additional details