arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0805.4300cs.DScs.DM
收藏

完全Hash函数的平衡族及其应用

Balanced Families of Perfect Hash Functions and Their Applications

Noga Alon, Shai Gutner

摘要:

完美哈希函数的构造是一个很好的研究课题。在本文中,这个概念被概括为以下定义。我们说从$[n]$到$[k]$的函数族是$δ$ -平衡$(n,k)$ -完美散列函数族,如果对于每个$S \subseteq [n]$,$|S|=k$,$S$上1-1的函数的数量在$T/δ$和$δT$之间,对于某个常数$T>0$。完美散列函数族的标准定义要求对于每个大小为$k$的$S$,至少有一个函数在$S$上为1-1。在平衡族的新概念中,我们要求对于每个这样的$S$,1-1函数的数量几乎相同(假设$δ$接近1)。我们的主要结果是,对于任何常数$δ> 1$,一个$δ$ -平衡的$(n,k)$ -族的大小为$2^{O(k \log \log k)} \log n$的完美散列函数可以在时间上构造$2^{O(k \log \log k)} n \log n$ .使用颜色编码的技术,我们可以应用我们的明确的结构设计近似算法的各种计数问题的图。特别是,我们展示了一个确定性的多项式时间算法近似的长度$k$的简单路径的数量和大小$k$的简单循环的数量为任何$k \leq O(\frac{\log n}{\log \log \log n})$在一个图中的$n$顶点。该近似值达到任何固定的所需相对误差。

英文摘要:

The construction of perfect hash functions is a well-studied topic. In this paper, this concept is generalized with the following definition. We say that a family of functions from $[n]$ to $[k]$ is a $δ$-balanced $(n,k)$-family of perfect hash functions if for every $S \subseteq [n]$, $|S|=k$, the number of functions that are 1-1 on $S$ is between $T/δ$ and $δT$ for some constant $T>0$. The standard definition of a family of perfect hash functions requires that there will be at least one function that is 1-1 on $S$, for each $S$ of size $k$. In the new notion of balanced families, we require the number of 1-1 functions to be almost the same (taking $δ$ to be close to 1) for every such $S$. Our main result is that for any constant $δ> 1$, a $δ$-balanced $(n,k)$-family of perfect hash functions of size $2^{O(k \log \log k)} \log n$ can be constructed in time $2^{O(k \log \log k)} n \log n$. Using the technique of color-coding we can apply our explicit constructions to devise approximation algorithms for various counting problems in graphs. In particular, we exhibit a deterministic polynomial time algorithm for approximating both the number of simple paths of length $k$ and the number of simple cycles of size $k$ for any $k \leq O(\frac{\log n}{\log \log \log n})$ in a graph with $n$ vertices. The approximation is up to any fixed desirable relative error.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑