Variety evasive sets

DOI10.1007/s00037-013-0073-9zbMath1308.68166arXiv1203.4532OpenAlexW2027976532MaRDI QIDQ475333

Shachar Lovett, János Kollár, Zeev Dvir

Publication date: 26 November 2014

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.4532

zbMATH Keywords

finite fieldsexplicit constructionsde-randomizationaffine variety

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Reductions modulo primes of systems of polynomial equations and algebraic dynamical systems, Partition and analytic rank are equivalent over large fields, Unnamed Item, A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density, Elements of large order on varieties over prime finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability and fast quantifier elimination in algebraically closed fields
• On the Noether-Lefschetz theorem and some remarks on codimension-two cycles
• On the construction of affine extractors
• Deterministic extractors for affine sources over large fields
• Norm-graphs and bipartite Turán numbers
• THE KAKEYA SET AND MAXIMAL CONJECTURES FOR ALGEBRAIC VARIETIES OVER FINITE FIELDS
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• Subspace evasive sets