A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum (Q3186828): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s1990478915030060 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2203216890 / rank | |||
Normal rank | |||
Latest revision as of 08:42, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum |
scientific article |
Statements
A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum (English)
0 references
12 August 2016
0 references
search for vector subset
0 references
randomized algorithm
0 references
asymptotical exactness
0 references
