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. © 2011 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
APA
Goldreich, O., & Wigderson, A. (2011). On the circuit complexity of perfect hashing. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6650 LNCS, 26–29. https://doi.org/10.1007/978-3-642-22670-0_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free