Pages that link to "Item:Q1708599"
From MaRDI portal
The following pages link to An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations (Q1708599):
Displaying 3 items.
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← 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)