Pages that link to "Item:Q812398"

The following pages link to Improving exact algorithms for MAX-2-SAT (Q812398):

Displaying 11 items.

• A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
• Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
• An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
• Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
• Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
• Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
• (Q2728900) (← links)
• (Q4425953) (← links)