On Efficient Algorithms for SAT

DOI10.1007/978-3-642-36751-9_20zbMath1388.68130OpenAlexW1552021214MaRDI QIDQ4913846

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 automataregular languagesmembrane computingnew computing paradigmsSAT-problemuniform solutionP-NP

Mathematics Subject Classification ID

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

Related Items (1)

Sublinear P system solutions to NP-complete problems

This page was built for publication: On Efficient Algorithms for SAT