Complexity of evolution in maximum cooperative P systems

DOI10.1007/s11047-009-9107-2zbMath1185.68334WikidataQ57936916 ScholiaQ57936916MaRDI QIDQ2655502

Gabriel Ciobanu, Andreas Resios

Publication date: 25 January 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-009-9107-2

zbMATH Keywords

computational complexity; integer linear programming; cooperative P systems

Mathematics Subject Classification ID

90C05: Linear programming

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)