scientific article; zbMATH DE number 1113996
From MaRDI portal
Publication:4375761
zbMath0889.03030MaRDI QIDQ4375761
Publication date: 14 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05)
Related Items (10)
Efficient 3-SAT algorithms in the tile assembly model ⋮ Local search algorithms for SAT: Worst-case analysis ⋮ Unnamed Item ⋮ A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between ⋮ New methods for 3-SAT decision and worst-case analysis ⋮ On a generalization of extended resolution ⋮ Separating signs in the propositional satisfiability problem ⋮ Improving Efficiency of 3-SAT-Solving Tile Systems ⋮ Investigations on autark assignments ⋮ A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
This page was built for publication:
