Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107): Difference between revisions

@@ Property / cites work @@
+Linear Circuits over $\operatorname{GF}(2)$
@@ Property / cites work: Linear Circuits over $\operatorname{GF}(2)$ / rank @@
+Normal rank
@@ Property / cites work @@
+Superconcentrators of depths 2 and 3; odd levels help (rarely)
+Normal rank
@@ Property / cites work @@
+On ACC
@@ Property / cites work: On ACC / rank @@
+Normal rank
@@ Property / cites work @@
+A Lower Bound for Matrix Multiplication
@@ Property / cites work: A Lower Bound for Matrix Multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the bounded coefficient complexity of bilinear maps
+Normal rank
@@ Property / cites work @@
+Q3412385
@@ Property / cites work: Q3412385 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+A note on matrix rigidity
@@ Property / cites work: A note on matrix rigidity / rank @@
+Normal rank
@@ Property / cites work @@
+On set intersection representations of graphs
@@ Property / cites work: On set intersection representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
+Normal rank
@@ Property / cites work @@
+The Linear Complexity of Computation
@@ Property / cites work: The Linear Complexity of Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545524
@@ Property / cites work: Q5545524 / rank @@
+Normal rank
@@ Property / cites work @@
+Superconcentrators
@@ Property / cites work: Superconcentrators / rank @@
+Normal rank
@@ Property / cites work @@
+Superconcentrators of depth 2
@@ Property / cites work: Superconcentrators of depth 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication in bounded depth circuits
@@ Property / cites work: Communication in bounded depth circuits / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the use of determinant for proving lower bounds on the size of linear circuits
+Normal rank
@@ Property / cites work @@
+Some combinatorial-algebraic problems from complexity theory
+Normal rank
@@ Property / cites work @@
+Boolean Circuits, Tensor Ranks, and Communication Complexity
+Normal rank
@@ Property / cites work @@
+On shifting networks
@@ Property / cites work: On shifting networks / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
+Normal rank
@@ Property / cites work @@
+Lower bounds for polynomial evaluation and interpolation problems
+Normal rank
@@ Property / cites work @@
+Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
+Normal rank
@@ Property / cites work @@
+Q4164821
@@ Property / cites work: Q4164821 / rank @@
+Normal rank