How far from a worst solution a random solution of a \(k\) CSP instance can be? (Q1671024)
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: How far from a worst solution a random solution of a k CSP instance can be? |
scientific article; zbMATH DE number 6932718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How far from a worst solution a random solution of a \(k\) CSP instance can be? |
scientific article; zbMATH DE number 6932718 |
Statements
How far from a worst solution a random solution of a \(k\,\)CSP instance can be? (English)
0 references
6 September 2018
0 references
average differential ratio
0 references
optimization constraint satisfaction problems
0 references
orthogonal arrays
0 references
0.7817500829696655
0 references
0.7624027132987976
0 references
0.7624027132987976
0 references
0.7530355453491211
0 references
0.7486962080001831
0 references
