A Logarithmic Bound for Solving Subset Sum with P Systems
From MaRDI portal
Publication:5452061
DOI10.1007/978-3-540-77312-2_16zbMath1137.68384MaRDI QIDQ5452061
Miguel Á. Gutiérrez-Naranjo, Daniel Díaz-Pernil, Agustín Riscos-Núñez, Mario J. Pérez-Jiménez
Publication date: 28 March 2008
Published in: Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77312-2_16
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
A Logarithmic Bound for Solving Subset Sum with P Systems, P systems and computational algebraic topology, Formal verification of cP systems using PAT3 and ProB, Membrane parallelism for discrete Morse theory applied to digital images, Formal Verification of P Systems with Active Membranes through Model Checking
Cites Work
- Membrane computing. An introduction.
- A fast \(P\) system for finding a balanced 2-partition
- Computational efficiency of dissolution rules in membrane systems
- A Logarithmic Bound for Solving Subset Sum with P Systems
- Machines, Computations, and Universality
- Machines, Computations, and Universality
- Membrane Computing
- Unnamed Item
- Unnamed Item