The computational power of membrane systems under tight uniformity conditions
From MaRDI portal
Publication:537860
DOI10.1007/S11047-010-9244-7zbMATH Open1214.68159OpenAlexW1986546859MaRDI QIDQ537860FDOQ537860
Publication date: 23 May 2011
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: http://mural.maynoothuniversity.ie/12412/1/Woods_Computational_2011.pdf
Recommendations
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution
- Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems
- On a powerful class of non-universal P systems with active membranes
- Complexity classes for membrane systems: a survey
- Sublinear-space P systems with active membranes
Cites Work
- On uniformity within \(NC^ 1\)
- Nondeterministic Space is Closed under Complementation
- Title not available (Why is that?)
- Title not available (Why is that?)
- P systems with active membranes: Attacking NP-complete problems
- Membrane computing and complexity theory: A characterization of PSPACE
- Title not available (Why is that?)
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Title not available (Why is that?)
- Complexity classes in models of cellular computing with membranes
- Expressibility and Parallel Complexity
- Computational efficiency of dissolution rules in membrane systems
- Title not available (Why is that?)
Cited In (27)
- A Turing machine simulation by P systems without charges
- Bounding the space in P systems with active membranes
- Alternative space definitions for P systems with active membranes
- Simulating counting oracles with cooperation
- Shallow laconic P-systems can count
- Low-order continualization of an anisotropic membrane lattice with next-nearest interactions. Enhanced prediction of its dynamic behaviour
- Characterizing PSPACE with shallow non-confluent P systems
- P systems attacking hard problems beyond NP: a survey
- P Systems Simulating Oracle Computations
- Subroutines in P systems and closure properties of their complexity classes
- Asynchronous P systems with active membranes
- Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes
- Shallow Non-confluent P Systems
- A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules
- On the Computational Power of Flip-Flop Proteins on Membranes
- Predictors for flat membrane systems
- 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
- On the power of P systems with active membranes using weak non-elementary membrane division
- Characterising the complexity of tissue P systems with fission rules
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- The counting power of P systems with antimatter
- Depth-two P systems can simulate Turing machines with \textbf{NP} oracles
- Monodirectional P systems
- Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems
- A toolbox for simpler active membrane algorithms
This page was built for publication: The computational power of membrane systems under tight uniformity conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537860)
