The following pages link to Membrane Computing (Q5901894):
Displaying 10 items.
- Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem (Q403007) (← links)
- A linear time complexity of breadth-first search using P system with membrane division (Q459939) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- A uniform solution to SAT using membrane creation (Q870255) (← links)
- Formal verification of cP systems using PAT3 and ProB (Q1982961) (← links)
- Seeking computational efficiency boundaries: the Păun's conjecture (Q1982986) (← links)
- Solving the subset-problem by P systems with active membrans (Q2493281) (← links)
- A fast \(P\) system for finding a balanced 2-partition (Q2576610) (← links)
- Complexity aspects of polarizationless membrane systems (Q2655492) (← links)
- Formal Verification of P Systems with Active Membranes through Model Checking (Q2890294) (← links)
