ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
{{output}}
A minimal perfect hash function (MPHF) maps a set S of n keys to the first n integers without collisions. There is a lower bound of n log 2 e - O ( log n ) ≈ 1.44 n bits needed to represent an MPHF. This can be reached by a brute-force algorithm that tr... ...
