An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7433400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses |
scientific article; zbMATH DE number 7433400 |
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
0.9645286798477172
0 references
0.8711730241775513
0 references
0.8578606843948364
0 references
0.8508970737457275
0 references
0.8428467512130737
0 references
