20 citations · 164 across the 63 of their papers we have counts for
Showing 2012 · cs.CCShow all
3 papers · 2 filters
cs.CC2012★ 2 cited
New Lower Bounds for Matching Vector Codes
Abhishek Bhowmick, Zeev Dvir, Shachar Lovett
A Matching Vector (MV) family modulo is a pair of ordered lists and where with the following inner product patt…
cs.CC2012
Variety Evasive Sets
Zeev Dvir, János Kollár, Shachar Lovett
We give an explicit construction of a large subset of F^n, where F is a finite field, that has small intersection with any affine variety of fixed dimension and bounded degree. Our…
cs.CC2012
Testing Low Complexity Affine-Invariant Properties
Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett
Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that…