P systems attacking hard problems beyond NP: a survey (Q2299891)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	P systems attacking hard problems beyond NP: a survey	scientific article

Statements

scholarly article

0 references

P systems attacking hard problems beyond NP: a survey (English)

0 references

0 references

Journal of Membrane Computing

0 references

publication date

24 February 2020

0 references

zbMATH Keywords

P-system

0 references

membrane computing

0 references

computational complexity

0 references

NP

0 references

PP

0 references

PSPACE

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s41965-019-00017-y

0 references

Developments in Language Theory

0 references

Space complexity equivalence of P systems with active membranes and Turing machines

0 references

0 references

Uniform Solution of QSAT Using Polarizationless Active Membranes

0 references

Cell communication in tissue \(P\) systems: universality results

0 references

Membrane Computing

0 references

0 references

Membrane computing. 13th international conference, CMC 2012, Budapest, Hungary, August 28--31, 2012. Revised selected papers

0 references

Efficient simulation of tissue-like P systems by transition cell-like P systems

0 references

Membrane computing. 8th international workshop, WMC 2007 Thessaloniki, Greece, June 25--28, 2007. Revised selected and invited papers

0 references

Tissue P systems with channel states

0 references

Characterizing Tractability by Tissue-Like P Systems

0 references

0 references

Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources

0 references

0 references

On the Computational Power of Flip-Flop Proteins on Membranes

0 references

0 references

Computational Complexity of P Systems with Active Membranes

0 references

Complexity aspects of polarizationless membrane systems

0 references

Simulating Elementary Active Membranes

0 references

Membrane Division, Oracles, and the Counting Hierarchy

0 references

Characterising the complexity of tissue P systems with fission rules

0 references

Shallow Non-confluent P Systems

0 references

Solving QSAT in sublinear depth

0 references

Solving a special case of the P conjecture using dependency graphs with dissolution

0 references

Solving Numerical NP-Complete Problems with Spiking Neural P Systems

0 references

The Efficiency of Tissue P Systems with Cell Separation Relies on the Environment

0 references

0 references

Tissue P systems.

0 references

Complexity Classes for Membrane Systems: A Survey

0 references

Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P

0 references

The computational power of membrane systems under tight uniformity conditions

0 references

Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems

0 references

From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency

0 references

Spiking neural P systems with neuron division and budding

0 references

The computational complexity of tissue P systems with evolutional symport/antiport rules

0 references

On Flip-Flop Membrane Systems with Proteins

0 references

A Computational Complexity Theory in Membrane Computing

0 references

Complexity classes in models of cellular computing with membranes

0 references

An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation

0 references

P Systems with Elementary Active Membranes: Beyond NP and coNP

0 references

P Systems Simulating Oracle Computations

0 references

Non-confluence in divisionless P systems with active membranes

0 references

0 references

P Systems with Proteins on Membranes and Membrane Division

0 references

The power of communication: P systems with symport/antiport

0 references

Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers

0 references

0 references

0 references

An efficient time-free solution to QSAT problem using P systems with proteins on membranes

0 references

A time-free uniform solution to subset sum problem by tissue P systems with cell division

0 references

Time-free solution to SAT problem using P systems with active membranes

0 references

Limits of the Power of Tissue P Systems with Cell Division

0 references

Tissue P Systems with Cell Separation: Upper Bound by PSPACE

0 references

Membrane computing and complexity theory: A characterization of PSPACE

0 references

Selected Topics in Computational Complexity of Membrane Systems

0 references

P systems with proteins on membranes characterize PSPACE

0 references

Polynomial Complexity Classes in Spiking Neural P Systems

0 references

An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s41965-019-00017-y

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2299891

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2299891&oldid=36564274"