Niu, YunyunPan, LinqiangPérez Jiménez, Mario de JesúsRius Font, Miquel2021-04-272021-04-272011Niu, Y., Pan, L., Pérez Jiménez, M.d.J. y Rius Font, M. (2011). A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem. Fundamenta Informaticae, 109 (2), 179-188.0169-2968https://hdl.handle.net/11441/107919A 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 rulesapplication/pdf10engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Membrane ComputingTissue P SystemsCell divisionTripartite Matching Probleminfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/10.3233/FI-2011-503