Shallow non-confluent P systems
From MaRDI portal
Recommendations
Cites work
- Complexity classes in models of cellular computing with membranes
- Computational complexity of tissue-like P systems
- scientific article; zbMATH DE number 1583885 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- Membrane computing and complexity theory: A characterization of PSPACE
- Membrane division, oracles, and the counting hierarchy
- Non-confluence in divisionless P systems with active membranes
- P systems with active membranes: Attacking NP-complete problems
- Simulating elementary active membranes
- The computational power of cell division in P systems: Beating down parallel computers?
- The computational power of membrane systems under tight uniformity conditions
- Tissue P systems can be simulated efficiently with counting oracles
Cited in
(8)- Bounding the space in P systems with active membranes
- Shallow laconic P-systems can count
- Subroutines in P systems and closure properties of their complexity classes
- Characterizing PSPACE with shallow non-confluent P systems
- P systems attacking hard problems beyond NP: a survey
- A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division
- Characterising the complexity of tissue P systems with fission rules
- Active P-colonies
This page was built for publication: Shallow non-confluent P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975921)