On the complexity of a search for a subset of ``similar'' vectors (Q542229)
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: On the complexity of a search for a subset of ``similar vectors |
scientific article; zbMATH DE number 5905426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of a search for a subset of ``similar'' vectors |
scientific article; zbMATH DE number 5905426 |
Statements
On the complexity of a search for a subset of ``similar'' vectors (English)
0 references
8 June 2011
0 references
0.7791140079498291
0 references
0.7443532347679138
0 references
0.7423628568649292
0 references
0.7208953499794006
0 references
0.7036626935005188
0 references
