An O(n log n) algorithm for the generalized birthday problem (Q1391985)
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 1178672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(n log n) algorithm for the generalized birthday problem |
scientific article; zbMATH DE number 1178672 |
Statements
An O(n log n) algorithm for the generalized birthday problem (English)
0 references
23 July 1998
0 references
Clustering
0 references
Birthday problems
0 references
Complexity
0 references
Reliability
0 references
0.8163628578186035
0 references
