Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
From MaRDI portal
Publication:2298575
DOI10.1155/2019/5793234zbMath1435.68098OpenAlexW2954811600MaRDI QIDQ2298575
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
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)
Related Items (14)
Spiking neural P systems with lateral inhibition ⋮ Solving 3-SAT in distributed P systems with string objects ⋮ Weighted spiking neural P systems with polarizations and anti-spikes ⋮ Cell-like P systems with evolutional symport/antiport rules and membrane creation ⋮ Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework ⋮ Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion ⋮ The computational power of cell-like P systems with one protein on membrane ⋮ Time-free cell-like P systems with multiple promoters/inhibitors ⋮ Lump solutions and interaction solutions for the dimensionally reduced nonlinear evolution equation ⋮ Prolongation structures and \(N\)-soliton solutions for a new nonlinear Schrödinger-type equation via Riemann-Hilbert approach ⋮ Behavior of the correction equations in the Jacobi-Davidson method ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ Monodirectional tissue P systems with channel states ⋮ Cell-like P systems with polarizations and minimal rules
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Trading polarizations for labels in P systems with active membranes
- Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
- P systems with minimal parallelism
- Tissue P systems.
- The computational power of cell division in P systems: Beating down parallel computers?
- Computing with membranes
- 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
- Membrane computing. An introduction.
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Reaction systems with influence on environment
- P systems with proteins: a new frontier when membrane division disappears
- Inference of bounded L systems with polymorphic P systems
- Almost sure exponential stability of implicit numerical solution for stochastic functional differential equation with extended polynomial growth condition
- Riemann-Hilbert approach for an initial-boundary value problem of the two-component modified Korteweg-de Vries equation on the half-line
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Exponential stabilization of switched time-varying systems with delays and disturbances
- Further remark on P systems with active membranes and two polarizations
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- COMPUTATION OF RAMSEY NUMBERS BY P SYSTEMS WITH ACTIVE MEMBRANES
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- 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
- Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test
- Membrane Computing
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- EXACT SOLUTIONS FOR A DIRAC-TYPE EQUATION WITH N-FOLD DARBOUX TRANSFORMATION
- Two classes of permutation trinomials with Niho exponents
This page was built for publication: Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
