Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187): Difference between revisions
From MaRDI portal
Latest revision as of 10:00, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximating MAX SAT by moderately exponential and parameterized algorithms |
scientific article |
Statements
Approximating MAX SAT by moderately exponential and parameterized algorithms (English)
0 references
2 December 2014
0 references
maximum satisfiability
0 references
exponential time algorithms
0 references
approximation algorithms
0 references
0 references