Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating MAX SAT by moderately exponential and parameterized algorithms |
scientific article; zbMATH DE number 6376182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating MAX SAT by moderately exponential and parameterized algorithms |
scientific article; zbMATH DE number 6376182 |
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
0.9999999
0 references
0.9463593
0 references
0.9377437
0 references
0.9320187
0 references
0.93191934
0 references
