On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic | |||
| Property / full work available at URL | |||
| Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/10110/pdf/LIPIcs-ITCS-2019-17.pdf/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2903060623 / rank | |||
Normal rank | |||
| Property / title | |||
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (English) | |||
| Property / title: On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (English) / rank | |||
Normal rank | |||
Revision as of 09:15, 30 July 2024
scientific article; zbMATH DE number 7559060
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic |
scientific article; zbMATH DE number 7559060 |
Statements
18 July 2022
0 references
closest pair
0 references
bichromatic closest pair
0 references
contact dimension
0 references
fine-grained complexity
0 references
0 references
0 references
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (English)
0 references
