Sublinear P system solutions to NP-complete problems
From MaRDI portal
Recommendations
- On solving linear systems in sublinear time
- Complete problems for space bounded subclasses of NP
- Polynomial-time algorithms for submodular Laplacian systems
- Solving systems of polynomial inequalities in subexponential time
- Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- P systems attacking hard problems beyond NP: a survey
- scientific article; zbMATH DE number 30298
- scientific article; zbMATH DE number 3874957
- Solving a PSPACE-complete problem with cP systems
Cites work
- A linear-time tissue P system based solution for the 3-coloring problem
- Alternative representations of P systems solutions to the graph colouring problem
- An introduction to cP systems
- Computational Complexity
- Computing with membranes
- Formal verification of cP systems using PAT3 and ProB
- scientific article; zbMATH DE number 1735643 (Why is no real title available?)
- scientific article; zbMATH DE number 1158842 (Why is no real title available?)
- On efficient algorithms for SAT
- P systems with active membranes: Attacking NP-complete problems
- Solving a PSPACE-complete problem with cP systems
- Spiking neural P systems
- The complexity of theorem-proving procedures
- The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
- Tissue P systems.
Cited in
(3)
This page was built for publication: Sublinear P system solutions to NP-complete problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6038691)
