scientific article
From MaRDI portal
Publication:3721816
zbMath0592.68041MaRDI QIDQ3721816
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (5)
Local search algorithms for SAT: Worst-case analysis ⋮ Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets ⋮ New methods for 3-SAT decision and worst-case analysis ⋮ Separating signs in the propositional satisfiability problem ⋮ UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
This page was built for publication:
