@inproceedings{f312d4907be648538601fd10b2940ff8,

title = "Perfect hashing, graph entropy, and circuit complexity",

abstract = "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 ACo. 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.",

author = "Ilan Newman and Prabhakar Ragde and Avi Wigderson",

year = "1990",

language = "English",

isbn = "0818620722",

series = "Proc Fifth Annu Struct Complexity Theor",

publisher = "Publ by IEEE",

pages = "91--99",

booktitle = "Proc Fifth Annu Struct Complexity Theor",

note = "Proceedings of the Fifth Annual Structure in Complexity Theory Conference ; Conference date: 08-07-1990 Through 11-07-1990",

}