Perfect hashing, graph entropy, and circuit complexity

Ilan Newman, Prabhakar Ragde, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProc Fifth Annu Struct Complexity Theor
PublisherPubl by IEEE
Pages91-99
Number of pages9
ISBN (Print)0818620722
StatePublished - 1990
Externally publishedYes
EventProceedings of the Fifth Annual Structure in Complexity Theory Conference - Barcelona, Spain
Duration: 8 Jul 199011 Jul 1990

Publication series

NameProc Fifth Annu Struct Complexity Theor

Conference

ConferenceProceedings of the Fifth Annual Structure in Complexity Theory Conference
CityBarcelona, Spain
Period8/07/9011/07/90

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'Perfect hashing, graph entropy, and circuit complexity'. Together they form a unique fingerprint.

Cite this