The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability (Q6599765)
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 NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability |
scientific article; zbMATH DE number 7908384
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability |
scientific article; zbMATH DE number 7908384 |
Statements
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability (English)
0 references
6 September 2024
0 references
nonconvex quadratic programming
0 references
average complexity
0 references
tail probability
0 references
0 references
0 references
0 references
