The satisfiability threshold for randomly generated binary constraint satisfaction problems (Q5900940)
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: The satisfiability threshold for randomly generated binary constraint satisfaction problems |
scientific article; zbMATH DE number 5712671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The satisfiability threshold for randomly generated binary constraint satisfaction problems |
scientific article; zbMATH DE number 5712671 |
Statements
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (English)
0 references
26 May 2010
0 references
0.9873040914535522
0 references
0.8575197458267212
0 references
0.8514087200164795
0 references
0.8501814603805542
0 references
0.8459712862968445
0 references
