Simulating counting oracles with cooperation
From MaRDI portal
Publication:1982984
Recommendations
Cites work
- scientific article; zbMATH DE number 1583885 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1072530 (Why is no real title available?)
- A guide to membrane computing.
- A path to computational efficiency through membrane computing
- Characterising the complexity of tissue P systems with fission rules
- Computing with membranes
- Membrane computing and complexity theory: A characterization of PSPACE
- Membrane computing. An introduction.
- Membrane division, oracles, and the counting hierarchy
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- Monodirectional P systems
- P systems attacking hard problems beyond NP: a survey
- P systems with active membranes: Attacking NP-complete problems
- Polarizationless P systems with active membranes: computational complexity aspects
- Simulating elementary active membranes
- Spiking neural P systems
- Subroutines in P systems and closure properties of their complexity classes
- The computational power of membrane systems under tight uniformity conditions
- The counting power of P systems with antimatter
- Tissue P systems.
Cited in
(6)- Shallow laconic P-systems can count
- Membrane division, oracles, and the counting hierarchy
- The counting power of P systems with antimatter
- Tissue P systems can be simulated efficiently with counting oracles
- Depth-two P systems can simulate Turing machines with \textbf{NP} oracles
- P systems simulating oracle computations
This page was built for publication: Simulating counting oracles with cooperation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982984)