A Solution of Horn-SAT with P Systems Using Antimatter

DOI10.1007/978-3-319-28475-0_16MaRDI QIDQ2789137zbMATH OpenOpenAlexFDO

Authors Gábor Kolonits

Publication date 26 February 2016

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28475-0_16

Mathematics Subject Classification ID

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

Recommendations

• Solving SAT with P systems with anti-membranes
• Solving HPP and SAT by P systems with active membranes and separation rules
• Time-free solution to SAT problem using P systems with active membranes
• A mathematic-physical approach to the satisfiability problem
• Time-free solution to SAT problem by tissue P systems
• An efficient time-free solution to SAT problem by P systems with proteins on membranes
• Contrasat -- a contrarian SAT solver
• scientific article; zbMATH DE number 1958491
• From \texttt{SAT} to \texttt{SAT}-\texttt{UNSAT} using P systems with dissolution rules
• scientific article; zbMATH DE number 5575002

Cited in

(5)

• The counting power of P systems with antimatter
• A new method to simulate restricted variants of polarizationless P systems with active membranes
• Remarks on the computational power of some restricted variants of P systems with active membranes
• Antimatter as a frontier of tractability in membrane computing
• Solving SAT with P systems with anti-membranes

This page was built for publication: A Solution of Horn-SAT with P Systems Using Antimatter

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