On the optimal order of worst case complexity of direct search (Q276315): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-015-0908-1 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ol/DodangehVZ16 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-015-0908-1 / rank | |||
Normal rank | |||
Latest revision as of 13:09, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the optimal order of worst case complexity of direct search |
scientific article |
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
