Skip to main content
Avi Wigderson
Personal
Short Bio
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
Not All Keys can be Hashed in Constant Time
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
Y. Gil
F. Meyer auf der Heide
A. Wigderson
Publication:
Proceedings of the 22nd STOC, pp 244-253, May 1990.
Hide
Files
File:
Proceedings version (pdf)
Proceedings version (ps)
bibTeX
‹ Norms, XOR lemmas, and lower bounds for \(GF(2)\) polynomials and multiparty protocols
up
On Characterizing Nondeterministic Circuit Size ›