On the circuit complexity of perfect hashing

Oded Goldreich*, Avi Wigderson

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Scopus citations

Abstract

We consider the size of circuits that perfectly hash an arbitrary subset S⊂{0,1} n of cardinality 2 k into {0,1} m . We observe that, in general, the size of such circuits is exponential in 2k-m, and provide a matching upper bound.

Original languageEnglish
Title of host publicationStudies in Complexity and Cryptography
Subtitle of host publicationMiscellanea on the Interplay between Randomness and Computation
EditorsOded Goldreich
Pages26-29
Number of pages4
DOIs
StatePublished - 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6650 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Circuit Complexity
  • Perfect Hashing

Fingerprint

Dive into the research topics of 'On the circuit complexity of perfect hashing'. Together they form a unique fingerprint.

Cite this