A Logarithmic Bound for Solving Subset Sum with P Systems

DOI10.1007/978-3-540-77312-2_16zbMath1137.68384OpenAlexW1595596514MaRDI 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

Mathematics Subject Classification ID

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

Related Items (5)

Formal Verification of P Systems with Active Membranes through Model Checking ⋮ P systems and computational algebraic topology ⋮ Formal verification of cP systems using PAT3 and ProB ⋮ A Logarithmic Bound for Solving Subset Sum with P Systems ⋮ Membrane parallelism for discrete Morse theory applied to digital images

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A Logarithmic Bound for Solving Subset Sum with P Systems