Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379)
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: Worst-case study of local search for MAX-\(k\)-SAT. |
scientific article; zbMATH DE number 1981507
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case study of local search for MAX-\(k\)-SAT. |
scientific article; zbMATH DE number 1981507 |
Statements
Worst-case study of local search for MAX-\(k\)-SAT. (English)
0 references
15 September 2003
0 references
MAX-SAT
0 references
Schöning algorithm
0 references
Papadimitriou algorithm
0 references
0.9340861
0 references
0.9340861
0 references
0.9262762
0 references
0.9016035
0 references
0 references
0.88777757
0 references
0.8829298
0 references
0.8829298
0 references
