A Logarithmic Bound for Solving Subset Sum with P Systems
From MaRDI portal
Recommendations
- Asymptotically tight bounds on subset sums
- Tight bounds for the partial-sums problem
- A polynomial approximation scheme for the subset sum problem
- A near-linear pseudopolynomial time algorithm for subset sum
- A quadratic lower bound for subset sums
- Sublinear P system solutions to NP-complete problems
- A branch bound method for subset sum problem
- scientific article; zbMATH DE number 1104339
- Exponentially small bounds on the expected optimum of the partition and subset sum problems
Cites work
- A fast \(P\) system for finding a balanced 2-partition
- A Logarithmic Bound for Solving Subset Sum with P Systems
- A polynomial complexity class in P systems using membrane division
- Computational efficiency of dissolution rules in membrane systems
- scientific article; zbMATH DE number 1583871 (Why is no real title available?)
- Machines, Computations, and Universality
- Machines, Computations, and Universality
- Membrane Computing
- Membrane computing. An introduction.
Cited in
(7)- Formal verification of cP systems using PAT3 and ProB
- Membrane parallelism for discrete Morse theory applied to digital images
- Solving the subset-problem by P systems with active membrans
- Formal verification of P systems with active membranes through model checking
- A Logarithmic Bound for Solving Subset Sum with P Systems
- Unconventional Computation
- P systems and computational algebraic topology
This page was built for publication: A Logarithmic Bound for Solving Subset Sum with P Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452061)
