Solving HPP and SAT by P systems with active membranes and separation rules

DOI10.1007/s00236-006-0018-8zbMath1097.68045MaRDI QIDQ2502273

Artiom Alhazov, Lin-Qiang Pan

Publication date: 12 September 2006

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-006-0018-8

zbMATH Keywords

satisfiability problem; Hamiltonian path problem

Mathematics Subject Classification ID

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

Related Items

A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM, Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem, A linear time complexity of breadth-first search using P system with membrane division, Communication P systems on simplicial complexes with applications in cluster analysis, Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems, Solving the N-queens problem using dP systems with active membranes, Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation, Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework, A new method to simulate restricted variants of polarizationless P systems with active membranes, On the power of P systems with active membranes using weak non-elementary membrane division, LOGIC AND ARITHMETIC OPERATIONS WITH A CONSTANT NUMBER OF STEPS IN MEMBRANE COMPUTING

Cites Work

• Trading polarizations for labels in P systems with active membranes
• Complexity classes in models of cellular computing with membranes
• Computing with membranes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item