Seeking computational efficiency boundaries: the Păun's conjecture

DOI10.1007/S41965-020-00058-8zbMATH Open1469.68050OpenAlexW3093625900WikidataQ123331575 ScholiaQ123331575MaRDI QIDQ1982986FDOQ1982986

Authors: David Orellana-Martín, Agustín Riscos-Núñez 

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

Recommendations

• On a partial affirmative answer for a Păun's conjecture
• Unconventional Computation
• A computational complexity theory in membrane computing
• Complexity aspects of polarizationless membrane systems
• Polarizationless P systems with active membranes: computational complexity aspects

zbMATH Keywords

membrane computingcomputational complexity theoryP-systemsPăun's conjecture

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Computing with membranes
• Membrane computing. An introduction.
• Title not available (Why is that?)
• Tissue P systems.
• Spiking neural P systems
• Characterizing tractability by tissue-like P systems
• The power of communication: P systems with symport/antiport
• Computational complexity of tissue-like P systems
• Title not available (Why is that?)
• An optimal frontier of the efficiency of tissue P systems with cell separation
• 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
• Membrane Computing
• Complexity classes in models of cellular computing with membranes
• P Systems with Elementary Active Membranes: Beyond NP and coNP
• P systems simulating oracle computations
• Title not available (Why is that?)
• The efficiency of tissue P systems with cell separation relies on the environment
• Simulating elementary active membranes
• Membrane Computing
• Title not available (Why is that?)
• COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES
• A fast \(P\) system for finding a balanced 2-partition
• Membrane Computing
• A polynomial alternative to unbounded environment for tissue P systems with cell division
• Solving the subset-problem by P systems with active membrans
• Membrane fission versus cell division: when membrane proliferation is not enough
• Title not available (Why is that?)
• A path to computational efficiency through membrane computing
• Tissue-like P systems with evolutional symport/antiport rules
• 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
• Title not available (Why is that?)
• P systems with symport/antiport rules: when do the surroundings matter?
• Title not available (Why is that?)

Cited In (6)

• On the power of membrane dissolution in polarizationless P systems with active membranes
• A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules
• On the power of P systems with active membranes using weak non-elementary membrane division
• A tutorial on the formal framework for spiking neural P systems
• On a partial affirmative answer for a Păun's conjecture
• From heaps of matches to the limits of computability

This page was built for publication: Seeking computational efficiency boundaries: the Păun's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982986)