Sciweavers

ECCC
2010
124views more  ECCC 2010»
13 years 3 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
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...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
ECCC
2010
111views more  ECCC 2010»
13 years 3 months ago
Pseudorandom Generators for Group Products
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...
Michal Koucký, Prajakta Nimbhorkar, Pavel P...
ECCC
2010
82views more  ECCC 2010»
13 years 3 months ago
Pseudorandom Generators for Combinatorial Checkerboards
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...
Thomas Watson
ECCC
2010
82views more  ECCC 2010»
13 years 3 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
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...
Ran Raz
ECCC
2010
91views more  ECCC 2010»
13 years 3 months ago
Limits on the rate of locally testable affine-invariant codes
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...
Eli Ben-Sasson, Madhu Sudan
ECCC
2010
107views more  ECCC 2010»
13 years 3 months ago
{Algorithmic Minimal Sufficient Statistics: a New Definition
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...
Nikolay K. Vereshchagin
ECCC
2010
103views more  ECCC 2010»
13 years 3 months ago
Time-Space Efficient Simulations of Quantum Computations
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...
Dieter van Melkebeek, Thomas Watson