Computer Science – Computational Complexity
Scientific paper
2012-03-20
Computer Science
Computational Complexity
13 pages
Scientific paper
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 construction generalizes a recent result of
Dvir and Lovett (STOC 2012) who considered varieties of degree one (affine
subspaces).
Dvir Zeev
Kollár János
Lovett Shachar
No associations
LandOfFree
Variety Evasive Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Variety Evasive Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Variety Evasive Sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-496629