Sciweavers

68 search results - page 5 / 14
» focs 2007
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
Pseudorandom Bits for Polynomials
We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain th...
Andrej Bogdanov, Emanuele Viola
FOCS
2007
IEEE
14 years 1 months ago
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
Ran Raz, Amir Shpilka, Amir Yehudayoff
FOCS
2007
IEEE
13 years 11 months ago
Space-Efficient Identity Based Encryption Without Pairings
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which build...
Dan Boneh, Craig Gentry, Michael Hamburg
FOCS
2007
IEEE
14 years 1 months ago
Mixing Time Power Laws at Criticality
We study the mixing time of some Markov Chains converging to critical physical models. These models are indexed by a parameter β and there exists some critical value βc where th...
Yun Long, Asaf Nachmias, Yuval Peres
FOCS
2007
IEEE
14 years 1 months ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari