Sciweavers

2 search results - page 1 / 1
» On Matrix Rigidity and Locally Self-Correctable Codes
Sort
View
69
Voted
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
15 years 2 months ago
On Matrix Rigidity and Locally Self-Correctable Codes
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
Zeev Dvir
105
Voted
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
13 years 10 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