We first consider the problem of learning k-parities in the on-line mistake-bound model: given a hidden vector x ∈ {0, 1} with |x| = k and a sequence of “questions” a1, a2, · · · ∈ {0, 1} , where the… (More)

This work investigates the hardness of computing sparse solutions to systems of linear equations over F2. Consider the k-EvenSet problem: given a homogeneous system of linear equations over F2 on n… (More)