Sciweavers

COCO
2011
Springer
221views Algorithms» more  COCO 2011»
12 years 3 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
12 years 3 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
COCO
2011
Springer
261views Algorithms» more  COCO 2011»
12 years 3 months ago
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups
—In 1997, H˚astad showed NP-hardness of (1 − , 1/q + δ)-approximating Max-3Lin(Zq); however it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness...
Ryan O'Donnell, Yi Wu, Yuan Zhou
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 3 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
COCO
2011
Springer
209views Algorithms» more  COCO 2011»
12 years 3 months ago
Explicit Dimension Reduction and Its Applications
Zohar Shay Karnin, Yuval Rabani, Amir Shpilka