Pages that link to "Item:Q983185"
From MaRDI portal
The following pages link to Computational complexity of tissue-like P systems (Q983185):
Displayed 18 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)
- Membrane fission versus cell division: when membrane proliferation is not enough (Q896708) (← links)
- A uniform solution to the independent set problem through tissue P systems with cell separation (Q1762209) (← links)
- Time-free solution to SAT problem by tissue P systems (Q1992361) (← 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)
- 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)
- A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM (Q4923294) (← links)
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS (Q5404514) (← links)