Perfect hash function (nonfiction): Difference between revisions
Jump to navigation
Jump to search
(Created page with "In computer science, a '''perfect hash function''' for a set S is a hash function that maps distinct elements in S to a set of integers, with...") |
No edit summary |
||
| Line 30: | Line 30: | ||
[[Category:Nonfiction (nonfiction)]] | [[Category:Nonfiction (nonfiction)]] | ||
[[Category:Computer science (nonfiction)]] | [[Category:Computer science (nonfiction)]] | ||
[[Category:Hash functions (nonfiction)]] | |||
[[Category:Mathematics (nonfiction)]] | [[Category:Mathematics (nonfiction)]] | ||
[[Category:Set theory (nonfiction)]] | [[Category:Set theory (nonfiction)]] | ||
Latest revision as of 18:39, 6 December 2017
In computer science, a perfect hash function for a set S is a hash function that maps distinct elements in S to a set of integers, with no collisions. In mathematical terms, it is an injective function.
Perfect hash functions may be used to implement a lookup table with constant worst-case access time.
A perfect hash function has many of the same applications as other hash functions, but with the advantage that no collision resolution has to be implemented.
In the News
Fiction cross-reference
Nonfiction cross-reference
- Algorithm (nonfiction)
- Computer science (nonfiction)
- Hash function (nonfiction)
- Mathematics (nonfiction)
- Set theory (nonfiction)
External links:
- Computer science
- Computer science @ Wikipedia