Pages that link to "Item:Q1946835"
From MaRDI portal
The following pages link to A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835):
Displaying 5 items.
- 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)
- Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (Q2424882) (← links)
- Improved MaxSAT Algorithms for Instances of Degree 3 (Q3467831) (← links)
