scientific article
From MaRDI portal
zbMath0967.68074MaRDI QIDQ2707541
Giancarlo Mauri, Claudio Zandron, Claudio Ferretti
Publication date: 3 April 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
P Systems Simulating Oracle Computations, From regulated rewriting to computing with membranes: collapsing hierarchies, Non-confluence in divisionless P systems with active membranes, Solving the N-queens problem using dP systems with active membranes, On the power of P systems with active membranes using weak non-elementary membrane division, Membrane computing and complexity theory: A characterization of PSPACE, Complexity aspects of polarizationless membrane systems, On the computational complexity of membrane systems, The counting power of P systems with antimatter, A bibliometric analysis of membrane computing (1998--2019), On the power of membrane dissolution in polarizationless P systems with active membranes, Asynchronous P systems with active membranes, Towards automated deduction in cP systems, Active P-colonies, Solving 3-SAT in distributed P systems with string objects, A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules, Evaluating space measures in P systems, A key agreement protocol based on spiking neural P systems with anti-spikes, Spiking neural P systems: main ideas and results, Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes, Shallow Non-confluent P Systems, Space complexity equivalence of P systems with active membranes and Turing machines, A Turing machine simulation by P systems without charges, Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion, Bounding the space in P systems with active membranes, Simulating counting oracles with cooperation, Seeking computational efficiency boundaries: the Păun's conjecture, Alternative space definitions for P systems with active membranes, A new method to simulate restricted variants of polarizationless P systems with active membranes, Selected Topics in Computational Complexity of Membrane Systems, A uniform family of tissue P systems with cell division solving 3-COL in a linear time, A toolbox for simpler active membrane algorithms, Efficiently solving the bin packing problem through bio-inspired mobility, Time-free solution to SAT problem by P systems with active membranes and standard cell division rules, The computational power of membrane systems under tight uniformity conditions, Languages generated by P systems with active membranes, P systems with energy accounting∗, Computational complexity of tissue-like P systems, Compositional semantics of spiking neural P systems, Subroutines in P systems and closure properties of their complexity classes, Solving Numerical NP-Complete Problems with Spiking Neural P Systems, Tissue-like P systems with evolutional symport/antiport rules, P systems with proteins: a new frontier when membrane division disappears, Characterizing PSPACE with shallow non-confluent P systems, Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems, Monodirectional P systems, A Framework for Complexity Classes in Membrane Computing, Depth-two P systems can simulate Turing machines with \textbf{NP} oracles, Solving the 3-COL problem by using tissue P systems without environment and proteins on cells, Complexity classes for membrane systems, A guide to membrane computing., A Linear–time Tissue P System Based Solution for the 3–coloring Problem
