Skip to main content
SpringerLink
Log in

On the Circuit Complexity of Perfect Hashing

  • Chapter
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6650))

  • 1427 Accesses

Abstract

We consider the size of circuits that perfectly hash an arbitrary subset S ⊂ {0,1}n of cardinality 2k 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Babai, L., Itai, A.: A fast and Simple Randomized Algorithm for the Maximal Independent Set Problem. J. of Algorithms 7, 567–583 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  2. Carter, L., Wegman, M.: Universal Classes of Hash Functions. J. Computer and System Sciences 18, 143–154 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fredman, M., Komlós, J.: On the Size of Separating Systems and Perfect Hash Functions. SIAM J. Algebraic and Discrete Methods 5, 61–68 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fredman, M., Komlós, J., Szemerédi, E.: Storing a Sparse Table with O(1) Worst Case Access Time. Journal of the ACM 31, 538–544 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  5. Korner, J., Marton, K.: New Bounds for Perfect Hashing via Information Theory. Europ. J. Combinatorics 9, 523–530 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Mehlhorn, K.: Data Structures and Algorithms. EATCS Monographs on Theoretical Computer Science, vol. 1 (1984)

    Google Scholar 

  7. Nilli, A.: Perfect Hashing and Probability. Combinatorics, Probability and Computing 3, 407–409 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Oded Goldreich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Avi Wigderson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics and Computer Science, Weizmann Institute of Science, 76100, Rehovot, Israel

    Oded Goldreich

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Goldreich, O., Wigderson, A. (2011). On the Circuit Complexity of Perfect Hashing. In: Goldreich, O. (eds) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science, vol 6650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22670-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22670-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22669-4

  • Online ISBN: 978-3-642-22670-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation