scientific article; zbMATH DE number 1500507
From MaRDI portal
Publication:4501522
zbMath0959.68047MaRDI QIDQ4501522
Publication date: 6 May 2001
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
Improved exact algorithms for mildly sparse instances of MAX SAT ⋮ An upper (lower) bound for Max (Min) CSP ⋮ A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between ⋮ Linear-programming design and analysis of fast algorithms for Max 2-CSP ⋮ A tighter upper bound for random MAX \(2\)-SAT ⋮ Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. ⋮ Worst-case study of local search for MAX-\(k\)-SAT. ⋮ Solving sparse instances of Max SAT via width reduction and greedy restriction ⋮ New exact algorithms for the 2-constraint satisfaction problem ⋮ On the Lower Bounds of Random Max 3 and 4-SAT ⋮ A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP ⋮ On the lower bounds of random Max 3 and 4-SAT ⋮ Exact Algorithms for MAX-SAT ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ MAX-2-SAT ⋮ An Empirical Study of MAX-2-SAT Phase Transitions ⋮ Improving exact algorithms for MAX-2-SAT
