A dichotomy theorem for the resolution complexity of random constraint satisfaction problems (Q2839170)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6184145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dichotomy theorem for the resolution complexity of random constraint satisfaction problems |
scientific article; zbMATH DE number 6184145 |
Statements
4 July 2013
0 references
resolution complexity
0 references
random constraint satisfaction problems
0 references
A dichotomy theorem for the resolution complexity of random constraint satisfaction problems (English)
0 references
0.9191003441810608
0 references
0.8845826387405396
0 references
0.8802735805511475
0 references
0.8232958316802979
0 references
