ECCC
2010
13 years 11 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
ECCC
2010
13 years 11 months ago
2010
We prove that the pseudorandom generator introduced in [INW94] fools group products of a given finite group. The seed length is O(log n log 1 ), where n the length of the word and...
ECCC
2010
13 years 11 months ago
2010
ECCC
2010
13 years 11 months ago
2010
We define a combinatorial checkerboard to be a function f : {1, . . . , m}d {1, -1} of the form f(u1, . . . , ud) = d i=1 fi(ui) for some functions fi : {1, . . . , m} {1, -1}. T...
ECCC
2010
13 years 11 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
ECCC
2010
13 years 11 months ago
2010
ECCC
2010
13 years 11 months ago
2010
ECCC
2010
13 years 11 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
ECCC
2010
13 years 11 months ago
2010
We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another defini...
ECCC
2010
13 years 11 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...