An approximation algorithm for solving the problem of the search of a subset of vectors (Q3115249)
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: An approximation algorithm for solving the problem of the search of a subset of vectors |
scientific article; zbMATH DE number 6007887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for solving the problem of the search of a subset of vectors |
scientific article; zbMATH DE number 6007887 |
Statements
20 February 2012
0 references
searching for subset of vectors
0 references
NP-hardness
0 references
effective approximation algorithm
0 references
0.8652591109275818
0 references
0.8526133298873901
0 references
0.8314492106437683
0 references
0.8284750580787659
0 references
