Min-rank conjecture for log-depth circuits (Q657911): Difference between revisions

@@ Property / author @@
-Stasys P. Jukna
@@ Property / author: Stasys P. Jukna / rank @@
-Normal rank
@@ Property / author @@
+Stasys P. Jukna
@@ Property / author: Stasys P. Jukna / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2009.09.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1997575430
@@ Property / OpenAlex ID: W1997575430 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q123282575
@@ Property / Wikidata QID: Q123282575 / rank @@
+Normal rank
@@ Property / cites work @@
+Superconcentrators of depths 2 and 3; odd levels help (rarely)
+Normal rank
@@ Property / cites work @@
+Linear Circuits over $\operatorname{GF}(2)$
@@ Property / cites work: Linear Circuits over $\operatorname{GF}(2)$ / rank @@
+Normal rank
@@ Property / cites work @@
+Q3412385
@@ Property / cites work: Q3412385 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3831127
@@ Property / cites work: Q3831127 / 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 @@
+Q3487569
@@ Property / cites work: Q3487569 / rank @@
+Normal rank
@@ Property / cites work @@
+Entropy of operators or why matrix multiplication is hard for depth-two circuits
+Normal rank
@@ Property / cites work @@
+On the rigidity of Vandermonde matrices
@@ Property / cites work: On the rigidity of Vandermonde matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
+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 @@
+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 @@
+Q3990226
@@ Property / cites work: Q3990226 / rank @@
+Normal rank
@@ Property / cites work @@
+On shifting networks
@@ Property / cites work: On shifting networks / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean Circuits, Tensor Ranks, and Communication Complexity
+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 @@
+Improved lower bounds on the rigidity of Hadamard matrices
+Normal rank
@@ Property / cites work @@
+A remark on matrix rigidity
@@ Property / cites work: A remark on matrix rigidity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Matrix Rigidity Via a Quantum Argument
+Normal rank
@@ Property / cites work @@
+Q4164821
@@ Property / cites work: Q4164821 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036702
@@ Property / cites work: Q4036702 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:657911