{"version":"1.0","type":"link","title":"Perfect hash function - Newikis","description":"In computer science, a perfect hash function h for a set S is a hash function that maps distinct elements in S to a set of m integers, with no collisions. In mathematical terms, it is an injective function.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/7/71/Hash_table_4_1_1_0_0_0_0_LL.svg/1280px-Hash_table_4_1_1_0_0_0_0_LL.svg.png","thumbnail_width":1280,"thumbnail_height":1152}