A generalized sylvester-gallai type theorem for quadratic polynomials
From MaRDI portal
Publication:5092455
DOI10.4230/LIPIcs.CCC.2020.8OpenAlexW3046505869MaRDI QIDQ5092455
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/2003.05152
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
- Black-box identity testing of depth-4 multilinear circuits
- Algebraic independence and blackbox identity testing
- Equivalence of polynomial identity testing and polynomial factorization
- A survey of Sylvester's problem and its generalizations
- Progress on Polynomial Identity Testing-II
- Geometric complexity theory V: Efficient algorithms for Noether normalization
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
- IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
- Arithmetic Circuits: A survey of recent results and open questions
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
- Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
- Progress on Polynomial Identity Testing - II
- Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter
- Linear matroid intersection is in quasi-NC
- Sylvester-Gallai type theorems for quadratic polynomials
- Fractional Sylvester–Gallai theorems
- Blackbox Polynomial Identity Testing for Depth 3 Circuits
- From sylvester-gallai configurations to rank bounds
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Bisecants of Finite Collections of Sets in Linear Spaces
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Derandomizing polynomial identity tests means proving circuit lower bounds
This page was built for publication: A generalized sylvester-gallai type theorem for quadratic polynomials
