Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.039 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2174811417 / rank | |||
Normal rank | |||
Revision as of 23:03, 19 March 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
