Pages that link to "Item:Q1878397"

The following pages link to Improved exact algorithms for MAX-SAT (Q1878397):

Displaying 14 items.

• Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
• 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)
• Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
• Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
• An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
• Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← 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)
• New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
• Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
• New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree (Q2891341) (← links)