Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614)
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: Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT |
scientific article; zbMATH DE number 2132493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT |
scientific article; zbMATH DE number 2132493 |
Statements
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (English)
0 references
9 February 2005
0 references
Probabilistic analysis
0 references
Random \(k\)-SAT
0 references
Random MAX \(2\)-SAT
0 references
Hypergraph discrepancy
0 references
0 references
0 references
0 references
0 references
0.9396994709968568
0 references
0.8599003553390503
0 references
0.8437590003013611
0 references
0.8387650847434998
0 references
