Perfect Hashing, Graph Entropy, and Circuit Complexity

@inproceedings{Newman1990PerfectHG,
  title={Perfect Hashing, Graph Entropy, and Circuit Complexity},
  author={Ilan Newman and Prabhakar Ragde and Avi Wigderson},
  booktitle={Structure in Complexity Theory Conference},
  year={1990}
}
We present two simple and general techniques, both of which should find further application. First, we show that approximate compaction can be efficiently performed in constant parallel time using perfect hash functions. This allows us to show that polylogarithmic-threshold functions are in linear $AC^0$. Next, we show that the information theoretic notion of graph entropy captures some aspect of the difficulty of computing Boolean functions. We use this to derive superlinear lower bounds on… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…