On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q509883 |
||
| Property / author | |||
| Property / author: C. S. Karthik / rank | |||
Revision as of 15:02, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On closest pair in Euclidean metric: monochromatic is as hard as bichromatic |
scientific article |
Statements
On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (English)
0 references
25 January 2021
0 references
closest pair
0 references
monochromatic
0 references
bichromatic
0 references
