Seeking computational efficiency boundaries: the Păun's conjecture
From MaRDI portal
Publication:1982986
DOI10.1007/S41965-020-00058-8zbMath1469.68050OpenAlexW3093625900WikidataQ123331575 ScholiaQ123331575MaRDI QIDQ1982986
Agustín Riscos-Núñez, David Orellana-Martín
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-020-00058-8
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (4)
On the power of P systems with active membranes using weak non-elementary membrane division ⋮ On the power of membrane dissolution in polarizationless P systems with active membranes ⋮ A tutorial on the formal framework for spiking neural P systems ⋮ A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The power of communication: P systems with symport/antiport
- Membrane computing and complexity theory: A characterization of PSPACE
- Membrane fission versus cell division: when membrane proliferation is not enough
- Computational complexity of tissue-like P systems
- Tissue P systems.
- Complexity classes in models of cellular computing with membranes
- Computing with membranes
- The computational complexity of tissue P systems with evolutional symport/antiport rules
- Solving a special case of the P conjecture using dependency graphs with dissolution
- Membrane computing. An introduction.
- P systems with symport/antiport rules: when do the surroundings matter?
- Tissue-like P systems with evolutional symport/antiport rules
- A path to computational efficiency through membrane computing
- Solving the subset-problem by P systems with active membrans
- A fast \(P\) system for finding a balanced 2-partition
- An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation
- A polynomial alternative to unbounded environment for tissue P systems with cell division
- P Systems Simulating Oracle Computations
- COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- Simulating Elementary Active Membranes
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- The Efficiency of Tissue P Systems with Cell Separation Relies on the Environment
- Membrane Computing
- Characterizing Tractability by Tissue-Like P Systems
- Membrane Computing
- Membrane Computing
This page was built for publication: Seeking computational efficiency boundaries: the Păun's conjecture
