Publication:2728900
From MaRDI portal
zbMath0971.68598MaRDI QIDQ2728900
Publication date: 4 November 2001
68U99: Computing methodologies and applications
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Efficient branch-and-bound algorithms for weighted MAX-2-SAT, A new upper bound for Max-2-SAT: A graph-theoretic approach, Solving sparse instances of Max SAT via width reduction and greedy restriction, Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT., Worst-case study of local search for MAX-\(k\)-SAT., Improved exact algorithms for MAX-SAT, Improved exact algorithms for mildly sparse instances of MAX SAT, Exact MAX-2SAT solution via lift-and-project closure, A new algorithm for optimal 2-constraint satisfaction and its implications, A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach