Minimal perfect hashing in polynomial time (Q911304)
From MaRDI portal
!
WARNING
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 4141519
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal perfect hashing in polynomial time |
scientific article; zbMATH DE number 4141519 |
Statements
Minimal perfect hashing in polynomial time (English)
0 references
1990
0 references
searching
0 references
minimal perfect hashing
0 references
complexity
0 references
0.909241795539856
0 references
0.8826833963394165
0 references
