The following pages link to (Q2707541):
Displaying 50 items.
- Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem (Q403007) (← links)
- Asynchronous P systems with active membranes (Q418762) (← links)
- A linear time complexity of breadth-first search using P system with membrane division (Q459939) (← links)
- A toolbox for simpler active membrane algorithms (Q524283) (← links)
- Efficiently solving the bin packing problem through bio-inspired mobility (Q530219) (← links)
- NP-completeness of the energy barrier problem without pseudoknots and temporary arcs (Q537858) (← links)
- The computational power of membrane systems under tight uniformity conditions (Q537860) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems (Q766179) (← links)
- Solving the 3-COL problem by using tissue P systems without environment and proteins on cells (Q781876) (← links)
- Non-confluence in divisionless P systems with active membranes (Q847664) (← links)
- Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes (Q852881) (← links)
- Membrane computing and complexity theory: A characterization of PSPACE (Q859989) (← links)
- Solving the factorization problem with P systems (Q952209) (← links)
- A uniform family of tissue P systems with cell division solving 3-COL in a linear time (Q953542) (← links)
- Computational complexity of tissue-like P systems (Q983185) (← links)
- Compositional semantics of spiking neural P systems (Q987958) (← links)
- Solving the N-queens problem using dP systems with active membranes (Q1643128) (← links)
- The counting power of P systems with antimatter (Q1682865) (← links)
- Design patterns for efficient solutions to \(\mathrm{NP}\)-complete problems in membrane computing (Q1709917) (← links)
- Languages generated by P systems with active membranes (Q1762936) (← links)
- A guide to membrane computing. (Q1853480) (← links)
- On the power of membrane division in P systems (Q1882915) (← links)
- From regulated rewriting to computing with membranes: collapsing hierarchies (Q1884943) (← links)
- A Turing machine simulation by P systems without charges (Q1982960) (← links)
- Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion (Q1982964) (← links)
- Bounding the space in P systems with active membranes (Q1982967) (← links)
- Simulating counting oracles with cooperation (Q1982984) (← links)
- Solving a PSPACE-complete problem with cP systems (Q1982985) (← links)
- Seeking computational efficiency boundaries: the Păun's conjecture (Q1982986) (← links)
- Alternative space definitions for P systems with active membranes (Q1983009) (← links)
- A new method to simulate restricted variants of polarizationless P systems with active membranes (Q1983030) (← links)
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules (Q2003493) (← links)
- Depth-two P systems can simulate Turing machines with \textbf{NP} oracles (Q2077403) (← links)
- On the power of P systems with active membranes using weak non-elementary membrane division (Q2152305) (← links)
- Subroutines in P systems and closure properties of their complexity classes (Q2285669) (← links)
- Tissue-like P systems with evolutional symport/antiport rules (Q2291770) (← links)
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness (Q2298575) (← links)
- P systems with proteins: a new frontier when membrane division disappears (Q2299881) (← links)
- Characterizing PSPACE with shallow non-confluent P systems (Q2299883) (← links)
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems (Q2299884) (← links)
- Monodirectional P systems (Q2311264) (← links)
- Time-free solution to SAT problem using P systems with active membranes (Q2440831) (← links)
- Space complexity equivalence of P systems with active membranes and Turing machines (Q2440832) (← links)
- Solving HPP and SAT by P systems with active membranes and separation rules (Q2502273) (← links)
- Complexity aspects of polarizationless membrane systems (Q2655492) (← links)
- P systems with active membranes: Attacking NP-complete problems (Q2708469) (← links)
- P systems with energy accounting<sup>∗</sup> (Q2763946) (← links)
- A linear-time tissue P system based solution for the 3-coloring problem (Q2864198) (← links)
- P Systems Simulating Oracle Computations (Q2890301) (← links)
