Efficient randomized algorithm for a vector subset problem (Q3133208)
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: Efficient randomized algorithm for a vector subset problem |
scientific article; zbMATH DE number 6837841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient randomized algorithm for a vector subset problem |
scientific article; zbMATH DE number 6837841 |
Statements
Efficient Randomized Algorithm for a Vector Subset Problem (English)
0 references
13 February 2018
0 references
vector subset
0 references
randomized algorithm
0 references
asymptotically exact algorithm
0 references
performance guarantees
0 references
0.8845521211624146
0 references
0.834379255771637
0 references
0.8179105520248413
0 references
0.796593427658081
0 references
0.7889407277107239
0 references
