Pages that link to "Item:Q766179"
From MaRDI portal
The following pages link to Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems (Q766179):
Displaying 6 items.
- Efficiently solving the bin packing problem through bio-inspired mobility (Q530219) (← links)
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems (Q766179) (← links)
- Synchronization of rules in membrane computing (Q1983026) (← links)
- Solving SAT with P systems with anti-membranes (Q6048241) (← links)
- The power of synchronizing rules in membrane computing (Q6118652) (← links)
- On the efficiency of synchronized P systems (Q6135703) (← links)
