The Computational Complexity of Universal Hashing

Abstract

Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings requires a time-space tradeoff of TS = f~(nm). The bound holds in the general boolean branching program model, and thus in essentially any model of computation. As a corollary, computing a + b • c in any field F requires a quadratic time-space tradeoff, and the bound… (More)
DOI: 10.1145/100216.100246

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Statistics

051015'91'94'97'00'03'06'09'12'15'18
Citations per Year

226 Citations

Semantic Scholar estimates that this publication has 226 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics