P systems simulating oracle computations
From MaRDI portal
Publication:2890301
Recommendations
Cites work
- scientific article; zbMATH DE number 1583885 (Why is no real title available?)
- scientific article; zbMATH DE number 2118901 (Why is no real title available?)
- An efficient simulation of polynomial-space Turing machines by P systems with active membranes
- Complexity classes in models of cellular computing with membranes
- Membrane computing and complexity theory: A characterization of PSPACE
- P systems with active membranes: Attacking NP-complete problems
- PP is as Hard as the Polynomial-Time Hierarchy
- The computational power of cell division in P systems: Beating down parallel computers?
- The computational power of membrane systems under tight uniformity conditions
Cited in
(11)- Bounding the space in P systems with active membranes
- Simulating counting oracles with cooperation
- P systems attacking hard problems beyond NP: a survey
- Subroutines in P systems and closure properties of their complexity classes
- Simulating R Systems by P Systems
- Seeking computational efficiency boundaries: the Păun's conjecture
- Space complexity equivalence of P systems with active membranes and Turing machines
- Membrane division, oracles, and the counting hierarchy
- A limitation of cell division in tissue P systems by PSPACE
- When object production tunes the efficiency of membrane systems
- Tissue P systems can be simulated efficiently with counting oracles
This page was built for publication: P systems simulating oracle computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890301)