Sciweavers

ECCC
2008
93views more  ECCC 2008»
13 years 3 months ago
A Note on the Distance to Monotonicity of Boolean Functions
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
Arnab Bhattacharyya
ECCC
2010
89views more  ECCC 2010»
13 years 3 months ago
Estimating the unseen: A sublinear-sample canonical estimator of distributions
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
Gregory Valiant, Paul Valiant
ECCC
2010
58views more  ECCC 2010»
13 years 3 months ago
Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition
Amit Chakrabarti, Graham Cormode, Ranganath Kondap...
ECCC
2010
80views more  ECCC 2010»
13 years 3 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
ECCC
2010
74views more  ECCC 2010»
13 years 3 months ago
Testing linear-invariant non-linear properties: A short report
The rich collection of successes in property testing raises a natural question: Why are so many different properties turning out to be locally testable? Are there some broad "...
Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Nin...
ECCC
2010
55views more  ECCC 2010»
13 years 3 months ago
Invariance in Property Testing
Madhu Sudan
ECCC
2010
104views more  ECCC 2010»
13 years 3 months ago
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
In this paper we give the first construction of a pseudorandom generator, with seed length O(log n), for CC0[p], the class of constant-depth circuits with unbounded fan-in MODp ga...
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
ECCC
2010
86views more  ECCC 2010»
13 years 3 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...
ECCC
2010
80views more  ECCC 2010»
13 years 3 months ago
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel