scientific article; zbMATH DE number 2118901
From MaRDI portal
Publication:4828293
zbMATH Open1085.68048MaRDI QIDQ4828293FDOQ4828293
Authors: Artiom Alhazov, Carlos Martín-Vide, Linqiang Pan 
Publication date: 25 November 2004
Title of this publication is not available (Why is that?)
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (39)
- A Turing machine simulation by P systems without charges
- Bounding the space in P systems with active membranes
- A bibliometric analysis of membrane computing (1998--2019)
- Membrane computing and complexity theory: A characterization of PSPACE
- P systems attacking hard problems beyond NP: a survey
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
- P systems based computing polynomials: design and formal verification
- A uniform solution to the independent set problem through tissue P systems with cell separation
- P Systems Simulating Oracle Computations
- Subroutines in P systems and closure properties of their complexity classes
- The computational power of cell division in P systems: Beating down parallel computers?
- Non-confluence in divisionless P systems with active membranes
- Trading polarizations for labels in P systems with active membranes
- Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
- On the power of membrane dissolution in polarizationless P systems with active membranes
- Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes
- Time-free Solution to Independent Set Problem using P Systems with Active Membranes
- Membrane Dissolution and Division in P
- P systems with proteins on membranes characterize PSPACE
- Computational efficiency and universality of timed P systems with active membranes
- Solving SAT with P systems with anti-membranes
- Title not available (Why is that?)
- Cell-like P systems with evolutional symport/antiport rules and membrane creation
- Evaluating space measures in P systems
- Space complexity equivalence of P systems with active membranes and Turing machines
- A new method to simulate restricted variants of polarizationless P systems with active membranes
- A linear time complexity of breadth-first search using P system with membrane division
- On the power of P systems with active membranes using weak non-elementary membrane division
- Solving HPP and SAT by P systems with active membranes and separation rules
- Cell-like P systems with polarizations and minimal rules
- Aspects of Molecular Computing
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Complexity classes for membrane systems
- Time-free solution to SAT problem using P systems with active membranes
- Simple Neural-Like P Systems for Maximal Independent Set Selection
- P systems with evolutional symport and membrane creation rules solving QSAT
- Selected Topics in Computational Complexity of Membrane Systems
- Monodirectional P systems
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828293)
