Pages that link to "Item:Q3499776"

The following pages link to New Bounds for MAX-SAT by Clause Learning (Q3499776):

Displaying 12 items.

• A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
• A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
• A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
• Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
• A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
• A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) (← links)
• A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• New upper bounds for the problem of maximal satisfiability (Q3225865) (← links)
• Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207) (← links)
• A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157) (← links)
• Theory and Applications of Satisfiability Testing (Q5713737) (← links)