Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
From MaRDI portal
Publication:2298575
DOI10.1155/2019/5793234zbMATH Open1435.68098OpenAlexW2954811600MaRDI QIDQ2298575FDOQ2298575
Authors: Bosheng Song, Yuan Kong 
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/5793234
Recommendations
- scientific article; zbMATH DE number 2118901
- Time-free solution to SAT problem using P systems with active membranes
- Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
- Time-free solution to independent set problem using P systems with active membranes
- scientific article
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Space complexity equivalence of P systems with active membranes and Turing machines
- A new approach for solving SAT by P systems with active membranes
- Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
- Decidability of termination problems for sequential P systems with active membranes
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Computational aspects of satisfiability (68R07)
Cites Work
- Computing with membranes
- Membrane computing. An introduction.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tissue P systems.
- Spiking neural P systems
- Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
- P systems with minimal parallelism
- Planning as quantified Boolean formula
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- An efficient time-free solution to SAT problem by P systems with proteins on membranes
- Computational efficiency and universality of timed P systems with active membranes
- Computational efficiency and universality of timed P systems with membrane creation
- Membrane Computing
- Almost sure exponential stability of implicit numerical solution for stochastic functional differential equation with extended polynomial growth condition
- The computational power of cell division in P systems: Beating down parallel computers?
- P systems with active membranes: Attacking NP-complete problems
- Title not available (Why is that?)
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Title not available (Why is that?)
- Further remark on P systems with active membranes and two polarizations
- Computation of Ramsey numbers by P systems with active membranes
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- Exponential stabilization of switched time-varying systems with delays and disturbances
- Exact solutions for a Dirac-type equation with N-fold Darboux transformation
- Trading polarizations for labels in P systems with active membranes
- Reaction systems with influence on environment
- Two classes of permutation trinomials with Niho exponents
- Riemann-Hilbert approach for an initial-boundary value problem of the two-component modified Korteweg-de Vries equation on the half-line
- The computational complexity of tissue P systems with evolutional symport/antiport rules
- Mixed lump-stripe soliton solutions to a dimensionally reduced generalized Jimbo-Miwa equation
- P systems with proteins: a new frontier when membrane division disappears
- Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test
- Inference of bounded L systems with polymorphic P systems
- On a class of coupled Hamiltonian operators and their integrable hierarchies with two potentials
- Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows
Cited In (27)
- Solving 3-SAT in distributed P systems with string objects
- Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion
- Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework
- The computational power of cell-like P systems with one protein on membrane
- Prolongation structures and \(N\)-soliton solutions for a new nonlinear Schrödinger-type equation via Riemann-Hilbert approach
- Time-free cell-like P systems with multiple promoters/inhibitors
- The computational power of monodirectional tissue P systems with symport rules
- Solving a PSPACE-complete problem with cP systems
- Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
- Behavior of the correction equations in the Jacobi-Davidson method
- Computational efficiency and universality of timed P systems with active membranes
- Cell-like P systems with evolutional symport/antiport rules and membrane creation
- Monodirectional tissue P systems with channel states
- A linear time complexity of breadth-first search using P system with membrane division
- Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division
- P systems with active membranes: Trading time for space
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Cell-like P systems with polarizations and minimal rules
- Weighted spiking neural P systems with polarizations and anti-spikes
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Time-free solution to independent set problem using P systems with active membranes
- Lump solutions and interaction solutions for the dimensionally reduced nonlinear evolution equation
- Time-free solution to SAT problem using P systems with active membranes
- Spiking neural P systems with lateral inhibition
- Title not available (Why is that?)
- The computational power of timed P systems with active membranes using promoters
- Title not available (Why is that?)
This page was built for publication: Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298575)
