The following pages link to (Q4511230):
Displayed 28 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)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← 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 efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← 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)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← 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)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
- Exact Algorithms for MAX-SAT (Q4916231) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- A Propositional CONEstrip Algorithm (Q5227400) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)