On a partial affirmative answer for a Păun's conjecture

DOI10.1142/S0129054111007824zbMATH Open1213.68275OpenAlexW2019793708WikidataQ123096352 ScholiaQ123096352MaRDI QIDQ3076597FDOQ3076597

Authors: Ignacio Pérez-Hurtado, Mario J. Pérez-Jiménez, Agustín Riscos-Núñez, Miguel A. Gutiérrez-Naranjo, Miquel Rius Font 

Publication date: 23 February 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111007824

Recommendations

• Solving a special case of the P conjecture using dependency graphs with dissolution
• A new method to simulate restricted variants of polarizationless P systems with active membranes
• Seeking computational efficiency boundaries: the Păun's conjecture
• Unconventional Computation
• scientific article; zbMATH DE number 1951597

zbMATH Keywords

computational complexitytractabilityactive membranesdissolution rulespolarizationless P systems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Complexity classes in models of cellular computing with membranes

Cited In (3)

• A path to computational efficiency through membrane computing
• Affirmative solution of a conjecture related to a sequence of Shanks
• The negative answer to Kameko's conjecture on the hit problem

This page was built for publication: On a partial affirmative answer for a Păun's conjecture

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