Pages that link to "Item:Q2283027"
From MaRDI portal
The following pages link to Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027):
Displaying 6 items.
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- An efficient algorithm for 3NF determination (Q558039) (← links)
- An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations (Q1708599) (← links)
- A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- md-MST is NP-hard for \(d\geq 3\) (Q2883542) (← links)