A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in Doubling Metrics (Q3387270)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in Doubling Metrics |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in
Doubling Metrics |
scientific article |
Statements
12 January 2021
0 references
A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in
Doubling Metrics The value's type "string" does not match Property's type "monolingualtext".
0 references
