Nicolescu, Radu, Dinneen, Michael J., Cooper, James, Henderson, Alec, and Liu, Yezhou (2022) Logarithmic SAT Solution with Membrane Computing. Axioms, 11. 66.

Preview

PDF (Published Version) - Published Version Available under License Creative Commons Attribution. Download (395kB) | Preview

 

1

553

Abstract

P systems have been known to provide efficient polynomial (often linear) deterministic solutions to hard problems. In particular, cP systems have been shown to provide very crisp and efficient solutions to such problems, which are typically linear with small coefficients. Building on a recent result by Henderson et al., which solves SAT in square-root-sublinear time, this paper proposes an orders-of-magnitude-faster solution, running in logarithmic time, and using a small fixed-sized alphabet and ruleset (25 rules). To the best of our knowledge, this is the fastest deterministic solution across all extant P system variants. Like all other cP solutions, it is a complete solution that is not a member of a uniform family (and thus does not require any preprocessing). Consequently, according to another reduction result by Henderson et al., cP systems can also solve k-colouring and several other NP-complete problems in logarithmic time.

Actions (Repository Staff Only)

Item Control Page