Two extensions of the Linial, Mansour, Nisan AC0 learning algorithm are presented. The LMN method works when input examples are drawn uniformly. The new algorithmsimprove on their...
Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smit...
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...