Skip to main content
Avi Wigderson
Personal
CV
Short CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
On the Circuit Complexity of Perfect Hashing
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
O. Goldreich
A. Wigderson
Publication:
Electronic Colloquium on Computational Complexit (ECCC) Report TR96-041, pp. 26-29, 1996.
Year:
1996
Files
File:
pdf
‹ On Rank vs. Communication Complexity
up
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions ›