A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem
From MaRDI portal
Publication:2895796
DOI10.3233/FI-2011-503zbMath1242.68116MaRDI QIDQ2895796
M. Rius-Font, Mario J. Pérez-Jiménez, Lin-Qiang Pan, Yun-yun Niu
Publication date: 4 July 2012
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Computing with viruses ⋮ The environment as a frontier of efficiency in tissue P systems with communication rules ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ An improved dynamic membrane evolutionary algorithm for constrained engineering design problems
This page was built for publication: A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem
