Variety evasive subspace families

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Variety evasive sets
Asymptotic behavior of the dimension of the Chow variety
Extractors and rank extractors for polynomial sources
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
Polyhedral and algebraic methods in computational geometry
Definability and fast quantifier elimination in algebraically closed fields
The equations defining Chow varieties
A probabilistic remark on algebraic program testing
Complexity of Chow varieties and number of morphisms on surfaces of general type
Der Endlichkeitssatz der Invarianten endlicher linearer Gruppen der Charakteristik $p$.
Über die Theorie der algebraischen Formen.
The Projective Noether Maple Package: Computing the dimension of a projective variety
The computational complexity of the Chow form
Extractors for varieties
Algebraic independence and blackbox identity testing
A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
Geometric complexity theory: an introduction for geometers
A combinatorial proof of the effective Nullstellensatz
Deterministic extractors for affine sources over large fields
Explicit subspace designs
Zur algebraischen Geometrie. IX. Über zugeordnete Formen und algebraische Systeme von algebraischen Mannigfaltigkeiten
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
Geometric complexity theory V: Efficient algorithms for Noether normalization
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
Testers and their applications
Pseudorandom generators for low degree polynomials
Progress on Polynomial Identity Testing - II
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Subspace designs based on algebraic function fields
Sharp Effective Nullstellensatz
Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter
A generalized Sylvester–Gallai-type theorem for quadratic polynomials
Efficient List-Decoding With Constant Alphabet and List Sizes
Sylvester-Gallai type theorems for quadratic polynomials
Randomness efficient identity testing of multivariate polynomials
A PSPACE construction of a hitting set for the closure of small algebraic circuits
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
Hitting sets for multilinear read-once algebraic branching programs, in any order
On identity testing of tensors, low-rank recovery and compressed sensing
Subspace evasive sets
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
Depth-4 Identity Testing and Noether’s Normalization Lemma
Polynomial time deterministic identity testing algorithm for Σ ^[3 ΠΣΠ ^[2] circuits via Edelstein–Kelly type theorem for quadratic polynomials]
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
Variety evasive subspace families

This page was built for publication: Variety evasive subspace families