Sylvester-Gallai type theorems for quadratic polynomials (Q5126776): Difference between revisions

@@ Property / cites work @@
+FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+Fractional Sylvester–Gallai theorems
@@ Property / cites work: Fractional Sylvester–Gallai theorems / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of Sylvester's problem and its generalizations
+Normal rank
@@ Property / cites work @@
+Algebraic Independence and Blackbox Identity Testing
+Normal rank
@@ Property / cites work @@
+Q5121901
@@ Property / cites work: Q5121901 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3413659
@@ Property / cites work: Q3413659 / rank @@
+Normal rank
@@ Property / cites work @@
+Sylvester-Gallai for arrangements of subspaces
@@ Property / cites work: Sylvester-Gallai for arrangements of subspaces / rank @@
+Normal rank
@@ Property / cites work @@
+Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
+Normal rank
@@ Property / cites work @@
+IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
+Normal rank
@@ Property / cites work @@
+Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
+Normal rank
@@ Property / cites work @@
+Bisecants of Finite Collections of Sets in Linear Spaces
+Normal rank
@@ Property / cites work @@
+Bipartite perfect matching is in quasi-NC
@@ Property / cites work: Bipartite perfect matching is in quasi-NC / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
+Normal rank
@@ Property / cites work @@
+Q4612482
@@ Property / cites work: Q4612482 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear matroid intersection is in quasi-NC
@@ Property / cites work: Linear matroid intersection is in quasi-NC / rank @@
+Normal rank
@@ Property / cites work @@
+A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.
+Normal rank
@@ Property / cites work @@
+Derandomizing polynomial identity tests means proving circuit lower bounds
+Normal rank
@@ Property / cites work @@
+Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
+Normal rank
@@ Property / cites work @@
+Blackbox Polynomial Identity Testing for Depth 3 Circuits
+Normal rank
@@ Property / cites work @@
+Equivalence of polynomial identity testing and polynomial factorization
+Normal rank
@@ Property / cites work @@
+Probability and Computing
@@ Property / cites work: Probability and Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric complexity theory V: Efficient algorithms for Noether normalization
+Normal rank
@@ Property / cites work @@
+Progress on Polynomial Identity Testing - II
@@ Property / cites work: Progress on Polynomial Identity Testing - II / rank @@
+Normal rank
@@ Property / cites work @@
+Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
+Normal rank
@@ Property / cites work @@
+Q5368765
@@ Property / cites work: Q5368765 / rank @@
+Normal rank
@@ Property / cites work @@
+Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter
+Normal rank
@@ Property / cites work @@
+From sylvester-gallai configurations to rank bounds
+Normal rank
@@ Property / cites work @@
+Black-box identity testing of depth-4 multilinear circuits
+Normal rank
@@ Property / cites work @@
+Arithmetic Circuits: A survey of recent results and open questions
+Normal rank