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

DOI10.1007/S41965-020-00058-8MaRDI QIDQ1982986zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1583885 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1161568 (Why is no real title available?)
• scientific article; zbMATH DE number 1951597 (Why is no real title available?)
• scientific article; zbMATH DE number 1568811 (Why is no real title available?)
• scientific article; zbMATH DE number 1836441 (Why is no real title available?)
• scientific article; zbMATH DE number 1870553 (Why is no real title available?)
• scientific article; zbMATH DE number 2089984 (Why is no real title available?)
• A fast \(P\) system for finding a balanced 2-partition
• A path to computational efficiency through membrane computing
• A polynomial alternative to unbounded environment for tissue P systems with cell division
• An optimal frontier of the efficiency of tissue P systems with cell separation
• COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES
• Characterizing tractability by tissue-like P systems
• Complexity classes in models of cellular computing with membranes
• Computational complexity of tissue-like P systems
• Computing with membranes
• Membrane Computing
• Membrane Computing
• Membrane Computing
• Membrane computing and complexity theory: A characterization of PSPACE
• Membrane computing. An introduction.
• Membrane fission versus cell division: when membrane proliferation is not enough
• P systems simulating oracle computations
• P systems with active membranes: Attacking NP-complete problems
• P systems with symport/antiport rules: when do the surroundings matter?
• P Systems with Elementary Active Membranes: Beyond NP and coNP
• Simulating elementary active membranes
• Solving a special case of the P conjecture using dependency graphs with dissolution
• Solving the subset-problem by P systems with active membrans
• Spiking neural P systems
• The computational complexity of tissue P systems with evolutional symport/antiport rules
• The efficiency of tissue P systems with cell separation relies on the environment
• The power of communication: P systems with symport/antiport
• Tissue P systems.
• Tissue-like P systems with evolutional symport/antiport rules
• Uniform Solution of QSAT Using Polarizationless Active Membranes

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)