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
The Discrete Logarithm Hides O(log n) Bits
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
D. Long
A. Wigderson
Publication:
Society for Industrial and Applied Mathematics (SIAM) Journal on Computing, vol. 17, no. 2, pp. 363-372, 1988.
Year:
1988
Abstract:
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/lw88.pdf
Files
File:
Journal version (pdf)
Journal version (ps)
‹ The Complexity of the Hamiltonian Circuit Problem for Maximal Planar Graphs
up
The Fusion Method for Lower Bounds in Circuit Complexity ›