期刊名称：Visnyk NTUU KPI : Informatics, Operation and Computer Science
印刷版ISSN：0135-1729
出版年度：2007
卷号：47
出版社：National Technical University of Ukraine
摘要：In article the problem of designing of the perfect hash-addressing for a constant set of keys is investigated. The algorithm of designing of the perfect hash-addressing as hierarchical system of Boolean functions is developed. The algorithm allows to significant reduce of volume of computing resources which is necessary for design of the perfect hash-transformation with the prescribed limit of hash-function complexity. The analysis has shown the advantages of proposed perfect hash-addressing designing algorithm in comparison to known algorithms of this problem decision.
