A fast \(P\) system for finding a balanced 2-partition

DOI10.1007/s00500-004-0397-0zbMath1101.68581OpenAlexW1968400118MaRDI QIDQ2576610

Agustín Riscos-Núñez, Mario J. Pérez-Jiménez, Miguel Á. Gutiérrez-Naranjo

Publication date: 13 December 2005

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-004-0397-0

zbMATH Keywords

Membrane computingActive membranesComplexity class

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (10)

Formal Verification of P Systems with Active Membranes through Model Checking ⋮ Complexity aspects of polarizationless membrane systems ⋮ A uniform solution to SAT using membrane creation ⋮ On the degree of parallelism in membrane systems ⋮ P systems and computational algebraic topology ⋮ LOGIC AND ARITHMETIC OPERATIONS WITH A CONSTANT NUMBER OF STEPS IN MEMBRANE COMPUTING ⋮ Seeking computational efficiency boundaries: the Păun's conjecture ⋮ Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes ⋮ A Logarithmic Bound for Solving Subset Sum with P Systems ⋮ Computational efficiency of dissolution rules in membrane systems

Cites Work

• Computing with membranes
• A guide to membrane computing.
• Membrane Computing
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast \(P\) system for finding a balanced 2-partition