Pages that link to "Item:Q983185"
From MaRDI portal
The following pages link to Computational complexity of tissue-like P systems (Q983185):
Displaying 35 items.
- Computing with viruses (Q264553) (← links)
- An efficient time-free solution to SAT problem by P systems with proteins on membranes (Q295645) (← links)
- A linear time complexity of breadth-first search using P system with membrane division (Q459939) (← links)
- A limitation of cell division in tissue P systems by PSPACE (Q473203) (← links)
- Computational power of cell separation in tissue P systems (Q506362) (← links)
- Tissue P systems with cell separation: attacking the partition problem (Q543208) (← links)
- Solving the 3-COL problem by using tissue P systems without environment and proteins on cells (Q781876) (← links)
- Membrane fission versus cell division: when membrane proliferation is not enough (Q896708) (← links)
- The computational complexity of tissue P systems with evolutional symport/antiport rules (Q1722689) (← links)
- A uniform solution to the independent set problem through tissue P systems with cell separation (Q1762209) (← links)
- Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework (Q1982962) (← links)
- Seeking computational efficiency boundaries: the Păun's conjecture (Q1982986) (← links)
- The computational power of cell-like P systems with one protein on membrane (Q1982988) (← links)
- Time-free solution to SAT problem by tissue P systems (Q1992361) (← links)
- Rule synchronization for tissue P systems (Q2051764) (← links)
- The computational power of monodirectional tissue P systems with symport rules (Q2051785) (← links)
- Monodirectional tissue P systems with channel states (Q2055533) (← links)
- Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division (Q2152307) (← links)
- P systems with symport/antiport rules: when do the surroundings matter? (Q2285670) (← links)
- Tissue-like P systems with evolutional symport/antiport rules (Q2291770) (← links)
- Cell-like P systems with polarizations and minimal rules (Q2306012) (← links)
- A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division (Q2318240) (← links)
- Characterising the complexity of tissue P systems with fission rules (Q2403238) (← 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)
- The computational power of tissue-like P systems with promoters (Q2628775) (← 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)
- Shallow Non-confluent P Systems (Q2975921) (← links)
- Probabilistic Guarded P Systems, A New Formal Modelling Framework (Q3454890) (← links)
- The computational power of timed P systems with active membranes using promoters (Q4629265) (← links)
- A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM (Q4923294) (← links)
- Simple Neural-Like P Systems for Maximal Independent Set Selection (Q5378208) (← links)
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS (Q5404514) (← links)
- A bibliometric analysis of membrane computing (1998--2019) (Q6135718) (← links)