On the optimal order of worst case complexity of direct search (Q276315)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6576723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the optimal order of worst case complexity of direct search |
scientific article; zbMATH DE number 6576723 |
Statements
On the optimal order of worst case complexity of direct search (English)
0 references
3 May 2016
0 references
direct search
0 references
worst case complexity
0 references
optimal order
0 references
sphere covering
0 references
positive spanning set
0 references
cosine measure
0 references
0 references
0 references
0.9274199
0 references
0.8682307
0 references
0 references
0 references
0.8563976
0 references
0 references
