@inbook{eecb70046542442b886bd56969a7f7a2,
title = "On the circuit complexity of perfect hashing",
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.",
keywords = "Circuit Complexity, Perfect Hashing",
author = "Oded Goldreich and Avi Wigderson",
year = "2011",
doi = "10.1007/978-3-642-22670-0_4",
language = "אנגלית",
isbn = "9783642226694",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "26--29",
editor = "Oded Goldreich",
booktitle = "Studies in Complexity and Cryptography",
}