An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses |
scientific article |
Statements
An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (English)
0 references
25 November 2021
0 references
CNF formula
0 references
3-SAT
0 references
branching algorithm
0 references
complexity
0 references
parameterized complexity
0 references
0 references
0 references
