Assertion: resulting function | /r/HasProperty | complex
Facets:
Source sentences:
text: Finding a perfect hash function over more than a very small set of keys is usually computationally infeasible; the resulting function is likely to be more computationally complex than a standard hash function, and provides only a marginal advantage over a function with good statistical properties that yields a minimum number of collisions.