To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1fp9hFull metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Dvir, Zeev | - |
| dc.contributor.author | Kollar, Janos | - |
| dc.contributor.author | Lovett, Shachar | - |
| dc.date.accessioned | 2017-11-21T19:48:32Z | - |
| dc.date.available | 2017-11-21T19:48:32Z | - |
| dc.date.issued | 2014-12 | en_US |
| dc.identifier.citation | Dvir, Zeev, Kollar, Janos, Lovett, Shachar. (2014). Variety Evasive Sets. COMPUTATIONAL COMPLEXITY, 23 (509 - 529. doi:10.1007/s00037-013-0073-9 | en_US |
| dc.identifier.issn | 1016-3328 | - |
| dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1fp9h | - |
| dc.description.abstract | We give an explicit construction of a large subset , where 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 (that is, affine subspaces). | en_US |
| dc.format.extent | 509 - 529 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | COMPUTATIONAL COMPLEXITY | en_US |
| dc.rights | Author's manuscript | en_US |
| dc.title | Variety Evasive Sets | en_US |
| dc.type | Journal Article | en_US |
| dc.identifier.doi | doi:10.1007/s00037-013-0073-9 | - |
| dc.date.eissued | 2013-06-25 | en_US |
| dc.identifier.eissn | 1420-8954 | - |
| pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 1203.4532v1.pdf | 169.67 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.