The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In (Q3451754): Difference between revisions

@@ Property / cites work @@
+Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Q4542578
@@ Property / cites work: Q4542578 / rank @@
+Normal rank
@@ Property / cites work @@
+Approaching the Chasm at Depth Four
@@ Property / cites work: Approaching the Chasm at Depth Four / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of depth-4 multilinear circuits with top fan-in 2
+Normal rank
@@ Property / cites work @@
+Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
+Normal rank
@@ Property / cites work @@
+Arithmetic circuits: the chasm at depth four gets wider
+Normal rank
@@ Property / cites work @@
+A super-polynomial lower bound for regular arithmetic formulas
+Normal rank
@@ Property / cites work @@
+Q4231906
@@ Property / cites work: Q4231906 / rank @@
+Normal rank
@@ Property / cites work @@
+Black-box identity testing of depth-4 multilinear circuits
+Normal rank
@@ Property / cites work @@
+Depth-3 arithmetic circuits over fields of characteristic zero
+Normal rank
@@ Property / cites work @@
+Arithmetic Circuits: A survey of recent results and open questions
+Normal rank
@@ Property / cites work @@
+Improved bounds for reduction to depth 4 and depth 3
+Normal rank
@@ Property / cites work @@
+Fast Parallel Computation of Polynomials Using Few Processors
+Normal rank