P systems with evolutional symport and membrane creation rules solving QSAT

DOI10.1016/j.tcs.2021.11.012OpenAlexW4200501229MaRDI QIDQ2077404

Mario J. Pérez-Jiménez, Luis Valencia-Cabrera, David Orellana-Martín

Publication date: 21 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.11.012

zbMATH Keywords

membrane computingcomputational complexity theorymembrane creation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Membrane creation and symport/antiport rules solving QSAT ⋮ P systems with evolutional communication and separation rules

Cites Work

• The power of communication: P systems with symport/antiport
• Trading polarizations for labels in P systems with active membranes
• Membrane computing and complexity theory: A characterization of PSPACE
• Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
• Tissue P systems.
• Complexity classes in models of cellular computing with membranes
• The computational complexity of tissue P systems with evolutional symport/antiport rules
• Cell-like P systems with evolutional symport/antiport rules and membrane creation
• Tissue-like P systems with evolutional symport/antiport rules
• P systems attacking hard problems beyond NP: a survey
• Solving QSAT in sublinear depth
• P Systems with Elementary Active Membranes: Beyond NP and coNP
• Membrane Creation in Polarizationless P Systems with Active Membranes
• Membrane Computing
• Membrane Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: P systems with evolutional symport and membrane creation rules solving QSAT