Solving the SAT problem with the string multiset rewriting calculus

DOI10.1007/S00607-024-01258-1MaRDI QIDQ6556322zbMATH OpenWikidataFDO

Authors Péter Battyányi

Publication date 17 June 2024

Published in Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00607-024-01258-1

zbMATH Keywords

biologically motivated computingSAT-problemstring multiset rewriting

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Grammars and rewriting systems (68Q42) Computational aspects of satisfiability (68R07)

Recommendations

• Solving 3-SAT in distributed P systems with string objects
• Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
• On efficient algorithms for SAT
• A new approach for solving SAT by P systems with active membranes
• scientific article; zbMATH DE number 1958491

This page was built for publication: Solving the SAT problem with the string multiset rewriting calculus

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