On efficient algorithms for SAT

DOI10.1007/978-3-642-36751-9_20MaRDI QIDQ4913846zbMATH OpenOpenAlexFDO

Authors Benedek Nagy

Publication date 16 April 2013

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36751-9_20

zbMATH Keywords

efficiencyfinite automatamembrane computingnew computing paradigmsP-NPregular languagesSAT-problemuniform solution

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
• A new approach for solving SAT by P systems with active membranes
• Algorithms – ESA 2005
• Solving satisfiability in less than \(2^ n\) steps
• Membrane Computing

Cited in

(5)

• On the greedy algorithm for satisfiability
• STACS 2004
• Theory and Applications of Satisfiability Testing
• Sublinear P system solutions to NP-complete problems
• Solving the SAT problem with the string multiset rewriting calculus

This page was built for publication: On efficient algorithms for SAT

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