The average performance analysis of a closest‐pair algorithm (Q3339288)
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 3872680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The average performance analysis of a closest‐pair algorithm |
scientific article; zbMATH DE number 3872680 |
Statements
The average performance analysis of a closest‐pair algorithm (English)
0 references
1984
0 references
computational geometry
0 references
probabilistic analysis of algorithms
0 references
geometric probabiliy
0 references
planar closest pair problem
0 references
average case performance
0 references
0.7895962595939636
0 references
0.7870490550994873
0 references
0.7807733416557312
0 references
0.765681266784668
0 references
0.763461709022522
0 references
