On the optimal order of worst case complexity of direct search (Q276315): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58040503, #quickstatements; #temporary_batch_1710276387428 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-015-0908-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2189378081 / rank | |||
Normal rank | |||
Revision as of 03:13, 20 March 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
