How far from a worst solution a random solution of a \(k\,\)CSP instance can be? (Q1671024): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-94667-2_31 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4301785514 / rank | |||
Normal rank | |||
Latest revision as of 20:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How far from a worst solution a random solution of a \(k\,\)CSP instance can be? |
scientific article |
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
