Pages that link to "Item:Q616992"

The following pages link to A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992):

Displaying 8 items.

• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
• Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
• Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
• A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
• New upper bounds for the problem of maximal satisfiability (Q3225865) (← links)
• New Upper Bounds for Maximum Satisfiability (Q4500858) (← links)