Complexity of evolution in maximum cooperative P systems

DOI10.1007/s11047-009-9107-2zbMath1185.68334DBLPjournals/nc/CiobanuR09OpenAlexW2042746150WikidataQ57936916 ScholiaQ57936916MaRDI QIDQ2655502

Andreas Resios, Gabriel Ciobanu

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 complexityinteger linear programmingcooperative P systems

Mathematics Subject Classification ID

Linear programming (90C05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• A new polynomial-time algorithm for linear programming
• Uniform Solution of QSAT Using Polarizationless Active Membranes
• Linear Programming in O([n3/ln nL) Operations]
• Membrane Computing
• Membrane Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of evolution in maximum cooperative P systems