Perfect hashing, graph entropy, and circuit complexity

It is shown that approximate compaction can be efficiently performed in constant parallel time using perfect hash functions. This allows it to be shown that polylogarithmic-threshold functions are in linear AC/sup o/. Next, it is shown that the information-theoretic notion of graph entropy captures some aspect of the difficulty of computing Boolean functions. This is used to derive superlinear lower bounds on the formula size of threshold and other simple Boolean functions.<<ETX>>

[1]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[2]  Marc Snir.  The covering problem of complete uniform hypergraphs , 1979, Discret. Math..

[3]  Michael L. Fredman.  And e.szemer~di.storing a sparse table with o(1) worst case access time , 1982, FOCS 1982.

[4]  Kurt Mehlhorn,et al.  On the program size of perfect and universal hash functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[6]  Michael Ben-Or,et al.  A theorem on probabilistic constant depth Computations , 1984, STOC '84.

[7]  Richard J. Lipton,et al.  Unbounded Fan-In Circuits and Associative Functions , 1985, J. Comput. Syst. Sci..

[8]  David E. Muller,et al.  Bounds to Complexities of Networks for Sorting and for Switching , 1975, JACM.

[9]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[10]  Michael J. Fischer,et al.  Omega(n log n) Lower Bounds on Length of Boolean Formulas , 1982, SIAM J. Comput..

[11]  R. E. Krichevskii,et al.  Complexity of Contact Circuits Realizing a Function of Logical Algebra , 1964 .

[12]  Saharon Shelah,et al.  Definability by Constant-Depth Polynomial-Size Circuits , 1986, Inf. Control..

[13]  János Körner,et al.  New Bounds for Perfect Hashing via Information Theory , 1988, Eur. J. Comb..

[14]  J. Friedman.  Constructing O(n log n) Size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables , 1984, FOCS.

[15]  P. Ragde.  The parallel simplicity of compaction and chaining , 1990 .

[16]  Ronald Fagin,et al.  Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions , 1985, Theoretical Computer Science.

[17]  Ravi B. Boppana,et al.  Threshold functions and bounded deptii monotone circuits , 1984, STOC '84.

[18]  John H. Reif,et al.  An optimal parallel algorithm for integer sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[19]  Ravi B. Boppana.  Optimal separations between concurrent-write parallel machines , 1989, STOC '89.

[20]  Ravi B. Boppana,et al.  Threshold Functions and Bounded Depth Monotone Circuits , 1986, J. Comput. Syst. Sci..

[21]  J. Komlos,et al.  On the Size of Separating Systems and Families of Perfect Hash Functions , 1984 .

[22]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[23]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[24]  J. Körner.  Fredman-Kolmo´s bounds and information theory , 1986 .