The following pages link to (Q2707525):
Displaying 29 items.
- P systems and computational algebraic topology (Q630756) (← links)
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems (Q766179) (← links)
- Non-confluence in divisionless P systems with active membranes (Q847664) (← links)
- Membrane fission versus cell division: when membrane proliferation is not enough (Q896708) (← links)
- Solving the factorization problem with P systems (Q952209) (← links)
- Computational complexity of tissue-like P systems (Q983185) (← links)
- Computing with membranes (Q1582013) (← links)
- From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency (Q1643131) (← links)
- Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation (Q1682872) (← links)
- Design patterns for efficient solutions to \(\mathrm{NP}\)-complete problems in membrane computing (Q1709917) (← links)
- On the robust power of morphogenetic systems for time bounded computation (Q1749177) (← links)
- From regulated rewriting to computing with membranes: collapsing hierarchies (Q1884943) (← links)
- From NP-completeness to DP-completeness: a membrane computing perspective (Q2205967) (← links)
- When object production tunes the efficiency of membrane systems (Q2285671) (← links)
- P systems attacking hard problems beyond NP: a survey (Q2299891) (← links)
- Membrane automata for modeling biomolecular processes (Q2311302) (← links)
- A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division (Q2318240) (← links)
- Membrane computing to enhance time efficiency of minimum dominating set (Q2630783) (← links)
- Complexity aspects of polarizationless membrane systems (Q2655492) (← links)
- P systems with active membranes: Attacking NP-complete problems (Q2708469) (← links)
- Complexity classes for membrane systems (Q3431433) (← links)
- Simple Neural-Like P Systems for Maximal Independent Set Selection (Q5378208) (← links)
- A Logarithmic Bound for Solving Subset Sum with P Systems (Q5452061) (← links)
- Machines, Computations, and Universality (Q5710889) (← links)
- Aspects of Molecular Computing (Q5901846) (← links)
- Generating, computing and recognizing with virus machines (Q6093574) (← links)
- From \texttt{SAT} to \texttt{SAT}-\texttt{UNSAT} using P systems with dissolution rules (Q6135713) (← links)
- A bibliometric analysis of membrane computing (1998--2019) (Q6135718) (← links)
- Universal enzymatic numerical P systems with small number of enzymatic rules (Q6558635) (← links)
