On the circuit complexity of perfect hashing

Oded Goldreich; Avi Wigderson

doi:10.1007/978-3-642-22670-0_4

On the circuit complexity of perfect hashing

Oded Goldreich, Avi Wigderson

Weizmann Institute of Science, The Hebrew University of Jerusalem

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

We consider the size of circuits that perfectly hash an arbitrary subset S⊂{0,1} ⁿ 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 language	English
Title of host publication	Studies in Complexity and Cryptography
Subtitle of host publication	Miscellanea on the Interplay between Randomness and Computation
Editors	Oded Goldreich
Chapter	4
Pages	26-29
Number of pages	4
DOIs	https://doi.org/10.1007/978-3-642-22670-0_4
State	Published - 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6650 LNCS

Keywords

Circuit Complexity
Perfect Hashing

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-22670-0_4

Cite this

Goldreich, O., & Wigderson, A. (2011). On the circuit complexity of perfect hashing. In O. Goldreich (Ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation (pp. 26-29). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS). https://doi.org/10.1007/978-3-642-22670-0_4

@inbook{932f5c33e2f54aa9b1085700f7ae2a3a,

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",

}

Goldreich, O & Wigderson, A 2011, On the circuit complexity of perfect hashing. in O Goldreich (ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6650 LNCS, pp. 26-29. https://doi.org/10.1007/978-3-642-22670-0_4

On the circuit complexity of perfect hashing. / Goldreich, Oded; Wigderson, Avi.
Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. ed. / Oded Goldreich. 2011. p. 26-29 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - On the circuit complexity of perfect hashing

AU - Goldreich, Oded

AU - Wigderson, Avi

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Circuit Complexity

KW - Perfect Hashing

UR - http://www.scopus.com/inward/record.url?scp=84857555744&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22670-0_4

DO - 10.1007/978-3-642-22670-0_4

M3 - فصل

SN - 9783642226694

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 26

EP - 29

BT - Studies in Complexity and Cryptography

A2 - Goldreich, Oded

ER -

Goldreich O, Wigderson A. On the circuit complexity of perfect hashing. In Goldreich O, editor, Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. 2011. p. 26-29. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-22670-0_4

On the circuit complexity of perfect hashing

Abstract

Publication series

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this