On communication complexity of some hard problems in ECPe systems

DOI10.1007/978-3-642-54239-8_15MaRDI QIDQ5404853zbMATH OpenOpenAlexFDO

Authors Nestine Hope S. Hernandez, Richelle Ann B. Juayong, Henry N. Adorna

Publication date 28 March 2014

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54239-8_15

zbMATH Keywords

membrane computingcommunication complexityrecognizer P systemsevolution-communication P systems with energy

Mathematics Subject Classification ID

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

Recommendations

• On the communication complexity of the vertex cover problem and 3-satisfiability problem in ECP systems
• On evolution-communication P systems with energy having bounded and unbounded communication
• A survey of results on evolution-communication P systems with energy
• scientific article; zbMATH DE number 1951574
• Relating computations in non-cooperative transition P systems and evolution-communication P systems with energy

Cited in

(4)

• A survey of results on evolution-communication P systems with energy
• On evolution-communication P systems with energy having bounded and unbounded communication
• Relating computations in non-cooperative transition P systems and evolution-communication P systems with energy
• On the communication complexity of the vertex cover problem and 3-satisfiability problem in ECP systems

This page was built for publication: On communication complexity of some hard problems in ECPe systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404853)