scientific article
From MaRDI portal
Publication:3515202
zbMath1145.68426MaRDI QIDQ3515202
Fernando Sancho Caparrini, Mario J. Pérez-Jiménez, Álvaro Romero-Jiménez
Publication date: 29 July 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (33)
Flat maximal parallelism in P systems with promoters ⋮ Membrane computing to enhance time efficiency of minimum dominating set ⋮ From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency ⋮ On the power of P systems with active membranes using weak non-elementary membrane division ⋮ Complexity aspects of polarizationless membrane systems ⋮ A uniform solution to SAT using membrane creation ⋮ An efficient time-free solution to QSAT problem using P systems with proteins on membranes ⋮ P systems with proteins on membranes characterize PSPACE ⋮ A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time ⋮ A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time ⋮ A path to computational efficiency through membrane computing ⋮ On the power of membrane dissolution in polarizationless P systems with active membranes ⋮ Active P-colonies ⋮ A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules ⋮ A time-free uniform solution to subset sum problem by tissue P systems with cell division ⋮ Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes ⋮ A limitation of cell division in tissue P systems by PSPACE ⋮ Computational efficiency and universality of timed P systems with active membranes ⋮ A new method to simulate restricted variants of polarizationless P systems with active membranes ⋮ A uniform family of tissue P systems with cell division solving 3-COL in a linear time ⋮ Proof techniques in membrane computing ⋮ P systems with active membranes: Trading time for space ⋮ A uniform solution to the independent set problem through tissue P systems with cell separation ⋮ A Prolog simulator for deterministic P systems with active membranes ⋮ Tissue P systems with cell separation: attacking the partition problem ⋮ Computational complexity of tissue-like P systems ⋮ A P-Lingua based simulator for tissue P systems ⋮ P systems with symport/antiport rules: when do the surroundings matter? ⋮ When object production tunes the efficiency of membrane systems ⋮ A Logarithmic Bound for Solving Subset Sum with P Systems ⋮ A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division ⋮ A fast \(P\) system for finding a balanced 2-partition ⋮ A Linear–time Tissue P System Based Solution for the 3–coloring Problem
This page was built for publication:
