is incompressible by AC^0[p] circuits
power of negations
cryptography (with S. Guo, T. Malkin, and A. Rosen). [ePrint:2014/902]
A simple algorithmic explanation for the
concentration of measure phenomenon. [Manuscript] Learning
circuits with few negations (with
E. Blais, C. Canonne, R. Servedio and L.-Y.
Tan). [ECCC:TR14-144] Erdos-Ko-Rado for random
hypergraphs: asymptotics and stability (with M. Gauy and H. Han). [arXiv:1409.3634] Algorithms
versus circuit lower bounds. [ECCC:TR13-117]
formulation of the graph reconstruction conjecture (with
hard functions from
learning algorithms (with A.
Klivans and P. Kothari).
complexity and the P vs. NP problem (in Portuguese).