Pages that link to "Item:Q2440831"
From MaRDI portal
The following pages link to Time-free solution to SAT problem using P systems with active membranes (Q2440831):
Displaying 16 items.
- An efficient time-free solution to SAT problem by P systems with proteins on membranes (Q295645) (← 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)
- Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion (Q1982964) (← links)
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules (Q2003493) (← links)
- Time-free cell-like P systems with multiple promoters/inhibitors (Q2003996) (← links)
- Cell-like P systems with evolutional symport/antiport rules and membrane creation (Q2216105) (← links)
- Time-freeness and clock-freeness and related concepts in P systems (Q2285665) (← links)
- P systems attacking hard problems beyond NP: a survey (Q2299891) (← links)
- P systems based computing polynomials: design and formal verification (Q2311269) (← links)
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes (Q2407106) (← links)
- A time-free uniform solution to subset sum problem by tissue P systems with cell division (Q2973245) (← links)
- The computational power of timed P systems with active membranes using promoters (Q4629265) (← links)
- Time-free Solution to Independent Set Problem using P Systems with Active Membranes (Q5025043) (← links)
- Solving SAT with P systems with anti-membranes (Q6048241) (← links)
- Solving 3-SAT in distributed P systems with string objects (Q6162062) (← links)
