The following pages link to (Q3515202):
Displaying 33 items.
- Flat maximal parallelism in P systems with promoters (Q264535) (← links)
- P systems with proteins on membranes characterize PSPACE (Q388151) (← links)
- A limitation of cell division in tissue P systems by PSPACE (Q473203) (← links)
- Computational efficiency and universality of timed P systems with active membranes (Q487991) (← links)
- P systems with active membranes: Trading time for space (Q537818) (← links)
- Tissue P systems with cell separation: attacking the partition problem (Q543208) (← links)
- A uniform solution to SAT using membrane creation (Q870255) (← 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)
- A P-Lingua based simulator for tissue P systems (Q987972) (← links)
- From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency (Q1643131) (← links)
- A uniform solution to the independent set problem through tissue P systems with cell separation (Q1762209) (← links)
- A Prolog simulator for deterministic P systems with active membranes (Q1762939) (← links)
- A new method to simulate restricted variants of polarizationless P systems with active membranes (Q1983030) (← links)
- Proof techniques in membrane computing (Q1998880) (← links)
- On the power of P systems with active membranes using weak non-elementary membrane division (Q2152305) (← links)
- P systems with symport/antiport rules: when do the surroundings matter? (Q2285670) (← links)
- When object production tunes the efficiency of membrane systems (Q2285671) (← links)
- A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division (Q2318240) (← links)
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes (Q2407106) (← links)
- A path to computational efficiency through membrane computing (Q2422042) (← links)
- A fast \(P\) system for finding a balanced 2-partition (Q2576610) (← links)
- Membrane computing to enhance time efficiency of minimum dominating set (Q2630783) (← links)
- Complexity aspects of polarizationless membrane systems (Q2655492) (← links)
- A Linear–time Tissue P System Based Solution for the 3–coloring Problem (Q2864198) (← links)
- A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time (Q2945571) (← links)
- A time-free uniform solution to subset sum problem by tissue P systems with cell division (Q2973245) (← links)
- Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes (Q2975915) (← links)
- A Logarithmic Bound for Solving Subset Sum with P Systems (Q5452061) (← links)
- A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time (Q6061997) (← links)
- On the power of membrane dissolution in polarizationless P systems with active membranes (Q6136468) (← links)
- Active P-colonies (Q6154804) (← links)
- A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules (Q6162071) (← links)
