Pages that link to "Item:Q4899239"

The following pages link to A New Algorithm for Parameterized MAX-SAT (Q4899239):

Displaying 9 items.

• Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
• Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
• An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
• A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
• Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (Q2424882) (← links)
• Improved MaxSAT Algorithms for Instances of Degree 3 (Q3467831) (← links)
• A Spectral Method for MAX2SAT in the Planted Solution Model (Q5387750) (← links)