On P systems with active membranes solving the integer factorization problem in a polynomial time
From MaRDI portal
(Redirected from On P systems with active membranes solving the integer factorization problem in a polynomial time)
On \(P\) systems with active membranes solving the integer factorization problem in a polynomial time
On \(P\) systems with active membranes solving the integer factorization problem in a polynomial time
Recommendations
Cited in
(8)- Self-witnessing polynomial-time complexity and prime factorization
- A guide to membrane computing.
- Accelerated execution of P systems with active membranes to solve the N-queens problem
- P systems with active membranes: Trading time for space
- The computational power of membrane systems under tight uniformity conditions
- Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
- Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
- Solving the factorization problem with P systems
This page was built for publication: On \(P\) systems with active membranes solving the integer factorization problem in a polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474017)
