From \texttt{SAT} to \texttt{SAT}-\texttt{UNSAT} using P systems with dissolution rules
DOI10.1007/S41965-022-00095-5zbMATH Open1518.68120OpenAlexW4224213479MaRDI QIDQ6135713FDOQ6135713
Authors: Agustín Riscos-Núñez, Luis Valencia-Cabrera 
Publication date: 26 August 2023
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-022-00095-5
Recommendations
- P Systems with Proteins on Membranes and Membrane Division
- A new approach for solving SAT by P systems with active membranes
- scientific article; zbMATH DE number 1951597
- Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
- P Systems with Elementary Active Membranes: Beyond NP and coNP
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Computational aspects of satisfiability (68R07)
Cites Work
- Title not available (Why is that?)
- Computing with membranes
- Title not available (Why is that?)
- Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
- The complexity of facets (and some facets of complexity)
- The Boolean Hierarchy I: Structural Properties
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Complexity classes in models of cellular computing with membranes
- Membrane Computing
- Title not available (Why is that?)
- Membrane creation in polarizationless P systems with active membranes
- Subroutines in P systems and closure properties of their complexity classes
- Membrane fission versus cell division: when membrane proliferation is not enough
- Title not available (Why is that?)
- Cell-like P systems with evolutional symport/antiport rules and membrane creation
- A Turing machine simulation by P systems without charges
- Title not available (Why is that?)
- Cell-like P systems with polarizations and minimal rules
- From NP-completeness to DP-completeness: a membrane computing perspective
Cited In (2)
This page was built for publication: From \texttt{SAT} to \texttt{SAT}-\texttt{UNSAT} using P systems with dissolution rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135713)
