On the difference between closest, furthest, and orthogonal pairs: nearly-linear vs barely-subquadratic complexity (Q4607966)
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 6850387
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the difference between closest, furthest, and orthogonal pairs: nearly-linear vs barely-subquadratic complexity |
scientific article; zbMATH DE number 6850387 |
Statements
15 March 2018
0 references
0.7876631617546082
0 references
0.7847195267677307
0 references
0.7625203728675842
0 references
0.741438090801239
0 references
