Pages that link to "Item:Q2708469"
From MaRDI portal
The following pages link to P systems with active membranes: Attacking NP-complete problems (Q2708469):
Displaying 50 items.
- P systems with proteins on membranes characterize PSPACE (Q388151) (← links)
- 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 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)
- Computational efficiency and universality of timed P systems with membrane creation (Q521731) (← links)
- A toolbox for simpler active membrane algorithms (Q524283) (← links)
- P systems with active membranes: Trading time for space (Q537818) (← links)
- The computational power of membrane systems under tight uniformity conditions (Q537860) (← links)
- Enhanced mobile membranes: computability results (Q537912) (← links)
- On the verification of membrane systems with dynamic structure (Q609035) (← links)
- Trading polarizations for labels in P systems with active membranes (Q707497) (← 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)
- 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)
- P systems with minimal parallelism (Q884455) (← links)
- Solving the factorization problem with P systems (Q952209) (← links)
- A quick introduction to membrane computing (Q987956) (← 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)
- 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)
- A uniform solution to the independent set problem through tissue P systems with cell separation (Q1762209) (← links)
- A guide to membrane computing. (Q1853480) (← links)
- Breaking DES using P systems. (Q1874407) (← links)
- On the power of membrane division in P systems (Q1882915) (← links)
- From regulated rewriting to computing with membranes: collapsing hierarchies (Q1884943) (← links)
- The conformon-P system: a molecular and cell biology-inspired computability model (Q1884951) (← links)
- A Turing machine simulation by P systems without charges (Q1982960) (← links)
- Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework (Q1982962) (← links)
- Bounding the space in P systems with active membranes (Q1982967) (← links)
- Coping with dynamical reaction system topologies using deterministic P modules: a case study of photosynthesis (Q1982982) (← 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)
- Shallow laconic P-systems can count (Q1983024) (← links)
- A new method to simulate restricted variants of polarizationless P systems with active membranes (Q1983030) (← links)
- Proof techniques in membrane computing (Q1998880) (← links)
- Spiking neural P systems with target indications (Q1998881) (← links)
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules (Q2003493) (← links)
- The computational power of monodirectional tissue P systems with symport rules (Q2051785) (← links)
- Morphogenetic systems for resource bounded computation and modeling (Q2056337) (← links)
- Depth-two P systems can simulate Turing machines with \textbf{NP} oracles (Q2077403) (← links)
- P systems with evolutional symport and membrane creation rules solving QSAT (Q2077404) (← links)
- P systems with evolutional communication and separation rules (Q2104141) (← 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)