Solving the subset-problem by P systems with active membrans

DOI10.1007/BF03037637zbMath1092.68043OpenAlexW1969180286MaRDI QIDQ2493281

Mario J. Pérez-Jiménez, Agustín Riscos-Núñez

Publication date: 12 June 2006

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037637

zbMATH Keywords

membrane computingcomplexity classesactive membranessubset-sum problem

Mathematics Subject Classification ID

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

Related Items (9)

Formal Verification of P Systems with Active Membranes through Model Checking ⋮ Membrane computing to enhance time efficiency of minimum dominating set ⋮ The computational power of enzymatic numerical P systems working in the sequential mode ⋮ Active P-colonies ⋮ LOGIC AND ARITHMETIC OPERATIONS WITH A CONSTANT NUMBER OF STEPS IN MEMBRANE COMPUTING ⋮ Formal verification of cP systems using PAT3 and ProB ⋮ Bounding the space in P systems with active membranes ⋮ Seeking computational efficiency boundaries: the Păun's conjecture ⋮ Monodirectional tissue P systems with channel states

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity classes in models of cellular computing with membranes
• Computing with membranes
• A Prolog simulator for deterministic P systems with active membranes
• Membrane computing. An introduction.
• Membrane Computing

This page was built for publication: Solving the subset-problem by P systems with active membrans