A new way of constructing (minimal) perfect hash functions is described. The technique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Evaluating a hash function requires just one multiplication and a few additions apart from primitive bit operations. The number of accesses to memory is two, one of which is to a fixed location. This improves the...

We consider the problem of covering the complete r-uniform hypergraphs on n vertices using complete r-partite graphs. We obtain lower bounds on the size of such a covering. For small values of r our result implies a lower bound of Ω( e r r √ r n log n) on the size of any such covering. This improves the previous bound of Ω(rn log n) due to Snir [5]. We also obtain good lower bounds on the size ...

the theory of perfect man that was dispersed in published works of islamic thinkers, started out as an independent subject and eventually annotations were added to it. the ontological aspect of this issue has been reviewed several times. however, the worldly functions of the perfect man have not been analyzed yet. unlike some mystics and sufis who limit the perfect man to practice in spiritual ...

A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set φ1, . . . , φs of linear functionals from V to F with the following property: for all t subsets X ⊆ V there exists i ∈ {1, . . . , s} such that φi is injective when restricted to F . A linear (qd, q, t)-perfect hash family of minimal size d(t− 1) is said to be optimal. I...

Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-simple (v, 5, 2)-BIBDs with possible exceptions of v ∈ {75, 95, 115, 135, 195, 215, 231, 285, 365, 385, 515}. In this article, we investigate the existence of a super-simple (v, 5, 4)-BIBD and show that such a design exi...

We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bitboards. Moreover, we show that simple variations of these schemes give minimal perfect hashing schemes. The new method is applicable provided N , the number of k-bit spaced positions that may be set to 1, is not more t...